Skip to main content
SpringerLink
Log in

Canonical Bottom-up Parsing

  • Conference paper
Book cover GI — 6. Jahrestagung

Part of the book series: Informatik — Fachberichte ((INFORMATIK,volume 5))

  • 35 Accesses

Abstract

A general theory of canonical bottom-up analysis is presented; it includes the familiar types of deterministic bottom-up parsing methods (e.g. precedence, bounded right context, LR, and LR-regular) as special cases. Among the results obtained are sufficient conditions on the means of construction to guarantee the resulting bottom-up-parsing method being deterministic.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, V.A., and Ullmann, 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.

    MathSciNet  MATH  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.

    Article  Google Scholar 

  5. Geller, M.M., and Harrison, M.A. (1973), Characterizations of LR(o) Languages, Proceedings of Symposium on Switching and Automata Theory 1973, 103–108.

    Google Scholar 

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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Kaiserslautern, Germany

    O. Mayer

Authors
  1. O. Mayer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Herdweg 51, D-7000, Stuttgart 1, Deutschland

    Erich J. Neuhold

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Mayer, O. (1976). Canonical Bottom-up Parsing. In: Neuhold, E.J. (eds) GI — 6. Jahrestagung. Informatik — Fachberichte, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95289-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95289-0_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07912-5

  • Online ISBN: 978-3-642-95289-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation