Skip to main content
SpringerLink
Log in

Reduction goals in bottom-up recognition

  • Theorie Der Programmierung
  • Conference paper
  • First Online:
GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen

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

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.

References

  • Ginsburg, S. The Mathematical Theory of Context-Free Languages, Mc Graw-Hill, N.Y. 1966.

    Google Scholar 

  • Małuszyński, J. Opewnej metodzie rozpoznawania jezyków bezkontekstowych, PWN, Warszawa 1972.

    Google Scholar 

  • Małuszyński, J. Subproblems of Parsing Problems, CCPAS Reports, Computation Centre, Polish Ac. of Sc., Report No.116 (1973).

    Google Scholar 

  • Naur, P. (ed.) Revised Report on the Algorithmic Language ALGOL 60, Numer. Math. 4, 420–453 (1963).

    Google Scholar 

Download references

Authors
  1. J. Maluszynski
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

Maluszynski, J. (1973). Reduction goals in bottom-up recognition. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039167

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06527-2

  • Online ISBN: 978-3-540-37826-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation