Advertisement

Simple chain grammars

  • Anton Nijholt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)

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.

Keywords

Read State Input Tape Simple Chain Parsing Process Greek Lower Case Letter 
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

  1. 1.
    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.Google Scholar
  2. 2.
    Conway M.E., Design of a seperable transition-diagram compiler, C.ACM 6,(1963), No.7. p.396–408.Google Scholar
  3. 3.
    DeRemer F.L., Simple LR(k) grammars, C.ACM 14, (1971), No.7, p.453–460.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    Geller M.M. and M.A. Harrison, On LR(k) grammars and languages, manuscript.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    Harrison M.A. and I.M. Havel, Strict deterministic grammars, J.Comput.System Sci. 7, (1973), No.3, p.237–277.Google Scholar
  10. 10.
    Harrison M.A. and I.M. Havel, On the parsing of deterministic languages, J.Assoc. Comput.Mach.21, (1974), No.4, p.525–548.Google Scholar
  11. 11.
    Knuth D.E., On the translation of languages from left to right, Info. and Control 8, (1965), No.6, p.607–639.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    Nijholt A., Simple chain languages, manuscript, march 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Anton Nijholt
    • 1
  1. 1.Department of MathematicsVrije UniversiteitAmsterdamThe Netherlands

Personalised recommendations