Skip to main content
SpringerLink
Log in

LR(0) grammars generated by LR(0) parsers

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Let Π be an LR(0) parser of a given LR(0) grammar G. Generally, Π does not only parse the words generated by G but also the words of some other LR(0) grammars different from G. In this paper we shall define a class of LR(0) parsers and shall present a characterization and a method for the construction of all LR(0) grammars which can be parsed by a given LR(0) parser.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Ullman, J.D.: Properties of syntax directed translations. JCSS 3, 319–334 (1969)

    Google Scholar 

  2. Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling, Vol. 1, parsing. Englewood Cliffs: Prentice-Hall 1972

    Google Scholar 

  3. Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling, Vol. 2, compiling. Englewood Cliffs: Prentice-Hall 1973

    Google Scholar 

  4. Aho, A.V., Ullman, J.D.: Optimization of LR(k) parsers. JCSS 6, 573–602 (1972)

    Google Scholar 

  5. DeRemer, F.: Simple LR(k) grammars. Comm. ACM 14, 453–460 (1971)

    Google Scholar 

  6. Harrison, M.A.: Introduction to formal language theory. Reading Mass: Addison-Wesley 1978

    Google Scholar 

  7. Hotz, G., Claus, V.: Automatentheorie und Formale Sprachen. Band 823a, Mannheim: Bibliographisches Institut, 1972

    Google Scholar 

  8. Joliat, M.L.: On the reduced matrix representation of LR(k) parser tables. Ph.D. thesis, University of Toronto (1973)

  9. Kemp, R.: An estimation of the set of states of the minimal LR(0) parser. In: Automata, languages and programming, (M. Nivat, ed.). Amsterdam: North-Holland, p. 563, 1973

    Google Scholar 

  10. Kemp, R.: Minimierung von LR(k)-Analysatoren. Techn. Rep. A75/1, A75/2, Universität des Saarlandes, Saarbrücken, 1975

    Google Scholar 

  11. Kemp, R.: LR(0) grammars generated by LR(0) parsers. Techn. Rep. A79/18, Universität des Saarlandes, Saarbrücken, 1979

    Google Scholar 

  12. Korenjak, A.J.: A practical method for constructing LR(k) processors. Comm. ACM 12, 613–623 (1969)

    Google Scholar 

  13. Knuth, D.E.: On the translation of languages from left to right. Information and Control. 8, 607–639 (1965)

    Google Scholar 

  14. Pager, D.: A solution to an open problem by Knuth. Information and Control. 17, 462–473 (1970)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes, D-6600, Saarbrücken, Germany (Fed. Rep.)

    R. Kemp

Authors
  1. R. Kemp
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kemp, R. LR(0) grammars generated by LR(0) parsers. Acta Informatica 15, 265–280 (1981). https://doi.org/10.1007/BF00289265

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289265

Keywords

Search

Navigation