Skip to main content
SpringerLink
Log in

A Technique for Parsing Ambiguous Languages

  • Chapter
GI-4.Jahrestagung

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

Abstract

From a given context free grammar, it is possible in a variety of ways to generate automatically a program that acts as a recogniser for the language of that grammar. Under a number of conditions, depending on the particular technique used, this program is an “exact recogniser” of that language, accepting only sentences of the language and rejecting all other strings of symbols.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.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. J.M. Foster, Automatic Syntactic Analysis, Computer Monographs no. 7, Elsevier, 1970.

    Google Scholar 

  2. J.M. Foster, A syntax improving program, Computer Journal, Vol. I I, May 1968.

    Google Scholar 

  3. R. Kurki-Suonio, On top-to-bottom recognition and left-recursion, CACM Vol. 9, July 1966

    Google Scholar 

  4. D.E. Knuth, Top-Down Syntax Analysis, Acta Informatica 1, 1971. 246

    Google Scholar 

  5. P. Naur (Edo), Revised Report on the Algorithmic Language ALGOL 60, Num. Math. 4, 1963.

    Google Scholar 

  6. A. van Wijngaarden(Ed.), Revised Report on the Algorithmic Language ALGOL 68, to appear 1974.

    Google Scholar 

  7. D. Crowe, Generating Parsers for Affix Grammars, Comm. ACM 15, 8, August 1972.

    Article  MathSciNet  Google Scholar 

  8. H. Feuerhahn, A binary control structure and its relationship to grammars and Side Effects, proceedings of this conference.

    Google Scholar 

  9. C.H.A. Koster, Two-level grammars, Lecture Notes of an Advanced Course on Compiler Construction, Munich 1974, to appear as Springer Lecture Notes.

    Google Scholar 

  10. F.L. De Remer, Transformational grammars, ibidem

    Google Scholar 

  11. C,H.A, Koster, Using the CDL Compiler Compiler, ibidem.

    Google Scholar 

  12. T. Griffiths and S. Petrick, On the relative efficiencies of context-free grammar recognizers, Comm. ACM 8, 5, May 1965.

    Google Scholar 

  13. J. Earley, An efficient context-free parsing Algorithm, Comm. ACM 13, 2, February 1970.

    Google Scholar 

  14. C.H.A. Koster, Affix Grammars; in: Proceedings of the IFIP Working Conference on ALGOL 68 Implementation, Munich 1970, North Holland 1971.

    Google Scholar 

  15. J.C. Boussard, J.J. Duby (Eds.), Rapport d’Evaluation à ALGOL 68, Revue Française d’Informatique et de Recherche opérationelle No. B-1, 1971.

    Google Scholar 

  16. S.W. Golomb, L.D. Baumert, Backtrack programming, Journal of the ACM Vol. 12 No. 4, October 1965.

    Google Scholar 

  17. C.H. Bennet, Logical Reversibility of Computation, IBM Journal Res. Develop., November 1973

    Google Scholar 

  18. D.A. Watt, LR Parsing of Affix Grammars, Report No. 7, Computing Department, University of Glasgow, August 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Berlin, Germany

    C. H. A. Koster

Authors
  1. C. H. A. Koster
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Automatentheorie und Formale Sprachen, Fachbereich Kybernetik, Technische Universität Berlin, Otto-Suhr-Allee 18/20, 1 Berlin 10, Deutschland

    Dirk Siefkes

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Koster, C.H.A. (1975). A Technique for Parsing Ambiguous Languages. In: Siefkes, D. (eds) GI-4.Jahrestagung. Lecture Notes in Computer Science, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-40087-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-40087-6_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-39104-4

  • Online ISBN: 978-3-662-40087-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation