Skip to main content
Springer Nature Link
Log in

A framework for producing deterministic canonical bottom-up parsers

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1978 (MFCS 1978)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 64))

  • 117 Accesses

Abstract

A general framework for producing deterministic canonical bottom-up parsers is described and very general conditions on the means of construction are presented which guarantee that the parsing methods work correctly. These conditions cover all known types of deterministic canonical bottom-up-parsers.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aho, V.A., and Ullman, J.D. (1972), The Theory of Parsing, Translation and Compiling, Prentice Hall, Englewood Cliffs, N.J.

    Google Scholar 

  2. Culik II, K. and Cohen, R. (1973, LR-Regular Grammars — an Extension of LR(k)-Grammars, JCSS 7, 66–96.

    Google Scholar 

  3. De Remer, F.L (1971), Simple LR(k)-Grammars, CACM 14, 453–460.

    Google Scholar 

  4. Eickel, J., (1972), Methoden der Syntaktischen Analyse bei Formalen Sprachen, Lecture Notes in Economics and Mathematical Systems, Springer, Vol. 78, 37–53.

    Google Scholar 

  5. Ginsburg, S. (1966), The Mathematical Theory of Context-free Languages, Mc Graw-Hill, New York.

    Google Scholar 

  6. Hopcroft, J.E., and Ullman, J.D. (1969), Formal Languages and their relation to Automata, Addison Wesley, Reading, Mass.

    Google Scholar 

  7. Knuth, D.E. (1965), On the translation of languages from left to right, JC 8, 607–639.

    Google Scholar 

  8. Langmaack, H. (1971), Application of Regular Canonical Systems to Grammars Translatable from Left to Right, Acta Informatica 1, 111–114.

    Article  Google Scholar 

  9. Mayer,O. (1978), Syntaxanalyse, Bibliographisches Institut, Mannheim, Hochschultaschenbücher, Reihe Informatik, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Comp. Sc. Dept., University of Kaiserslautern (Germany), Germany

    O. Mayer

Authors
  1. O. Mayer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mayer, O. (1978). A framework for producing deterministic canonical bottom-up parsers. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_83

Download citation

  • DOI: https://doi.org/10.1007/3-540-08921-7_83

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08921-6

  • Online ISBN: 978-3-540-35757-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics