Skip to main content
SpringerLink
Log in

Almost top-down analysis for generalized LR(K) grammars

  • Chapter
  • First Online:
Methods of Algorithmic Language Implementation

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

  • 114 Accesses

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

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

    Google Scholar 

  2. Gries, D., Compiler Construction for Digital Computers, Wiley, New York, 1971

    Google Scholar 

  3. Rozenkrantz, D.J., Stearns, R.E., Properties of Deterministic Top-Down Grammars, Inf.&Contr. 17 (1970), 226–256.

    Google Scholar 

  4. Geller, M.M., Harrison, M.A., Characteristic Parsing. A Framework for Producing Compact Deterministic Parsers, to Appear.

    Google Scholar 

  5. Král, J., Parsing as a Subtask of Compiling, Math. Found. of Computer Sciences, Lecture Notes in Computer Science, Springer, 1975.

    Google Scholar 

  6. DeRemer, F.I., Simple LR(k) Grammars, CACM 14, 7, (1971), 453–460.

    Google Scholar 

  7. Král, J., Bottom-Up Versus Top-down Syntax Analysis Revised, Report of the ÚVT ČVUT, Prague, Horská 3, December 1974.

    Google Scholar 

  8. Král, J., Semi-top-down Transition Diagram Driven Syntax Analysis, Report of the ÚVT ČVUT, Prague, Horská 3, December 1974.

    Google Scholar 

  9. Levy, J.P., Automatic Correction of Syntax Errors in Programming Languages, PhD Thesis, Tech.Rep. TR 71-116, Comp.Sci.Dept., Cornell University, Ithaca,N.Y., Dec 1971.

    Google Scholar 

  10. Lomet, D.B., A Formalization of Transition Diagram Systems, IBM Research Report, J.Watson Res. Center, P.O. Box 218, Yorktown Hights, N.Y., 210598 (1970).

    Google Scholar 

  11. Conway, M.E., Design of a Separable Transition Diagram Compiler, Com ACM 6,7, (1963), 396–408.

    Google Scholar 

  12. Wirth, N., The Programming Language Pascal, Acta Informatica Vol. 1. Jan. 1971, 35–63.

    Google Scholar 

  13. Král, J., A Concise Graphic Form for the Algol 68 Syntax, Information Processing Machines 17, Academia, Prague 1974.

    Google Scholar 

  14. Král, J., Demner, J., Semi-Top-Down Syntactic Analysis, Report ÚVT ČVUT, 6/73/M, Horská 3, 126 00 Prague 2, (Aug 1973).

    Google Scholar 

  15. Geller, M.M., Harrison, M.A., On LR(k) Grammars and Languages, Comp.Sci.Div., Univ. of California at Berkeley, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ÚVT ČVUT, Horská 3, Prague 2, CSSR

    Jaroslav Král

Authors
  1. Jaroslav Král
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Ershov C. H. A. Koster

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Král, J. (1977). Almost top-down analysis for generalized LR(K) grammars. In: Ershov, A., Koster, C.H.A. (eds) Methods of Algorithmic Language Implementation. Lecture Notes in Computer Science, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08065-1_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-08065-1_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08065-7

  • Online ISBN: 978-3-540-37510-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation