Abstract
The paper extends the notion of context-free LL(k) grammars to CD grammar systems using two different derivation modes, examines some of the properties of the resulting language families, and studies the possibility of parsing these languages deterministically, without backtracking.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ulmann, J.D.: The Theory of Parsing, Translation, and Compiling, vol. I. Prentice-Hall, Englewood Cliffs, N.J. (1973)
Bordihn, H., Vaszil, Gy.: CD grammar systems with LL(k) conditions. In: Csuhaj-Varjú, E., Vaszil, Gy. (eds.) Proceedings of Grammar Systems Week, MTA SZTAKI, Budapest, pp. 95–112 (2004)
Bordihn, H., Vaszil, Gy.: On leftmost derivations in CD grammar systems. In: Loos, R., Fazekas, Sz. Zs., Martín-Vide, C. (eds.) Pre-Proceedings of the First International Conference on Language and Automata Theory and Applications, LATA 2007, Universitat Rovira i Virgili, Tarragona, pp. 187–198 (2007)
Csuhaj-Varjú, E., Dassow, J.: On cooperating/distributed grammar systems. Journal of Information Processing and Cybernetics EIK, 26(1-2), 49–63 (1990), (Presented at the 4th Workshop on Mathematical Aspects of Computer Science, Magdeburg, 1998)
Csuhaj-Varjú, E., Dassow, J., Kelemen, J.,Păun, Gh.: Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach Science Publishers, Yverdon (1994)
Dassow, J., Mitrana, V.: On the leftmost derivation in cooperating grammar systems. Rev. Roumaine Math. Pures Appl. 43, 361–374 (1998)
Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. Springer, Heidelberg (1989)
Dassow, J., Păun, Gh., Rozenberg, G.: Grammar Systems. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 4, pp. 155–213. Springer, Heidelberg (1997)
Mitrana, V.: Parsability approaches in CD grammar systems. In: Freund, R., Kelemenová, A. (eds.) Proceedings of the International Workshop Grammar Systems 2000, Silesian University at Opava, pp. 165–185 (2000)
Rosenkrantz, D.J., Stearns, R.E.: Properties of deterministic top-down grammars. Information and Control 17, 226–256 (1970)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bordihn, H., Vaszil, G. (2007). Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. In: Csuhaj-Varjú, E., Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 2007. Lecture Notes in Computer Science, vol 4639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74240-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-74240-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74239-5
Online ISBN: 978-3-540-74240-1
eBook Packages: Computer ScienceComputer Science (R0)