Abstract
A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there exist simple chain grammars which are not LL(k) for any k, this new class of grammars is very close related to the class of LL(1) and simple LL(1) grammars. In fact it can be proved (not in this paper) that each simple chain grammar has an equivalent simple LL(1) grammar. A very simple (bottom-up) parsing method is provided. This method follows directly from the definition of a simple chain grammar and can easily be given in terms of the well-known LR(0) parsing method.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aho A.V. and J.D. Ullman, 'The theory of parsing, translation and compiling', Vol. I and II, Prentice Hall, Englewood Cliffs, 1972 and 1973.
Conway M.E., Design of a seperable transition-diagram compiler, C.ACM 6,(1963), No.7. p.396–408.
DeRemer F.L., Simple LR(k) grammars, C.ACM 14, (1971), No.7, p.453–460.
Geller M.M., S.L. Graham and M.A. Harrison, Production prefix parsing, in ‘Automata, Languages and Programming', J. Loeckx (ed.), 1974, Lecture Notes in Computer Science 14, Springer-Verlag, Berlin, p.232–241.
Geller M.M. and M.A. Harrison, Strict deterministic versus LR(0) parsing, Conf. Record of ACM Sympos. on Principles of programming languages, Boston, Massachusetts, 1973, oct 1–3, p. 22–32.
Geller M.M. and M.A. Harrison, On LR(k) grammars and languages, manuscript.
Gray J. and M.A. Harrison, On the covering and reduction problems for context-free grammars, J.Assoc.Comput. Mach. 19, (1972), No.3, p.385–395.
Hammer M., A new grammatical transformation into LL(k) form, Conf.Record of 6th Ann. ACM Sympos. on Theory of Computing, 1974, p.266–275.
Harrison M.A. and I.M. Havel, Strict deterministic grammars, J.Comput.System Sci. 7, (1973), No.3, p.237–277.
Harrison M.A. and I.M. Havel, On the parsing of deterministic languages, J.Assoc. Comput.Mach.21, (1974), No.4, p.525–548.
Knuth D.E., On the translation of languages from left to right, Info. and Control 8, (1965), No.6, p.607–639.
Korenjak A.J. and J.E. Hopcroft, Simple deterministic languages, IEEE Conf.Record of 7th Annual Sympos. on Switching and Automata Theory, 1966, p.34–46.
Král J. and J. Demner, Parsing as a subtask of compiling, Sympos. on Mathematical Foundations of Computer Science, 4th, Mariánské Lázně, 1975, Lecture Notes in Computer Science 32, Springer-Verlag, Berlin, p.61–74.
Lomet D.B., Automatic generation of multiple exit parsing subroutines, in ‘Automata, Languages and Programming', J. Loeckx (ed.), 1974, Lecture Notes in Computer Science 14, Springer-Verlag, Berlin, p.214–231.
Nijholt A., Simple chain languages, manuscript, march 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nijholt, A. (1977). Simple chain grammars. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive