Abstract
Top-down syntax analysis can be based on \(\mathrm {LL}(k)\) grammars. The canonical acceptors for \(\mathrm {LL}(k)\) languages are deterministic stateless pushdown automata with input lookahead of size k. We investigate the computational capacity of reversible computations of such automata. A pushdown automaton with lookahead k is said to be reversible if its predecessor configurations can uniquely be computed by a pushdown automaton with backward input lookahead (lookback) of size k. It is shown that we cannot trade a lookahead for states or vice versa. The impact of having states or a lookahead depends on the language. While reversible pushdown automata with states accept all regular languages, we are going to prove that there are regular languages that cannot be accepted reversibly without states, even in case of an arbitrarily large lookahead. This completes the comparison of reversible with ordinary pushdown automata in our setting. Finally, it turns out that there are problems which can be solved by reversible deterministic stateless pushdown automata with lookahead of size \(k+1\), but not by any reversible deterministic stateless pushdown automaton with lookahead of size k. So, an infinite and tight hierarchy of language families dependent on the size of the lookahead is shown.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Angluin, D.: Inference of reversible languages. J. ACM 29, 741–765 (1982)
Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)
Holzer, M., Jakobi, S., Kutrib, M.: Minimal reversible deterministic finite automata. Int. J. Found. Comput. Sci. 29, 251–270 (2018)
Kari, J.: Reversible cellular automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 57–68. Springer, Heidelberg (2005). https://doi.org/10.1007/11505877_5
Knuth, D.E.: Top-down syntax analysis. Acta Inform. 1, 79–110 (1971)
Kutrib, M.: Aspects of reversibility for classical automata. In: Calude, C.S., Freivalds, G.R., Iwama, K. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 83–98. Springer (2014)
Kutrib, M.: Reversible and irreversible computations of deterministic finite-state devices. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 38–52. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48057-1_3
Kutrib, M., Malcher, A.: Fast reversible language recognition using cellular automata. Inform. Comput. 206, 1142–1151 (2008)
Kutrib, M., Malcher, A.: Real-time reversible iterative arrays. Theor. Comput. Sci. 411, 812–822 (2010)
Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78, 1814–1827 (2012)
Kutrib, M., Malcher, A., Wendlandt, M.: Real-time reversible one-way cellular automata. In: Isokawa, T., Imai, K., Matsui, N., Peper, F., Umeo, H. (eds.) AUTOMATA 2014. LNCS, vol. 8996, pp. 56–69. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18812-6_5
Kutrib, M., Worsch, T.: Degrees of reversibility for DFA and DPDA. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 40–53. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08494-7_4
Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961)
Lewis II, P.M., Stearns, R.E.: Syntax-directed transduction. J. ACM 15, 465–488 (1968)
Morita, K.: Reversible simulation of one-dimensional irreversible cellular automata. Theor. Comput. Sci. 148, 157–163 (1995)
Morita, K.: Reversible computing and cellular automata - a survey. Theor. Comput. Sci. 395, 101–131 (2008)
Rosenkrantz, D.J., Stearns, R.E.: Properties of deterministic top-down grammars. Inform. Control 17, 226–256 (1970)
Sippu, S., Soisalon-Soininen, E.: On \(\rm LL(k)\) parsing. Inform. Control 53, 141–164 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Kutrib, M., Meyer, U. (2021). Reversible Top-Down Syntax Analysis. In: Moreira, N., Reis, R. (eds) Developments in Language Theory. DLT 2021. Lecture Notes in Computer Science(), vol 12811. Springer, Cham. https://doi.org/10.1007/978-3-030-81508-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-81508-0_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-81507-3
Online ISBN: 978-3-030-81508-0
eBook Packages: Computer ScienceComputer Science (R0)