Skip to main content
SpringerLink
Log in

An efficient incremental LR parser for grammars with epsilon productions

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

This paper describes the implementation of an extension to Celentano's [2] incremental LR Parsing Algorithm that allows epsilon rules in the grammar.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Ullman, J.D.: Theory of Parsing, Translation and Compiling, Vols. 1 and 2. Englewood Cliffs, N.J.: Prentice Hall 1972/73

    Google Scholar 

  2. Celentano, A.: Incremental LR Parsers. Acta Informat. 10, 307–321 (1978)

    Google Scholar 

  3. Persch, G., Winterstein, G., Drossopoulou, S., Dausmann, M.: An LALR(l) Grammar for (Revised) Ada. ACM SIGPLAN Notices 16, 85–98 (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, University of Wisconsin-Madison, 1210 West Dayton Street, 53706, Madison, WI, USA

    Rakesh Agrawal & Keith D. Detro

Authors
  1. Rakesh Agrawal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keith D. Detro
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Agrawal, R., Detro, K.D. An efficient incremental LR parser for grammars with epsilon productions. Acta Informatica 19, 369–376 (1983). https://doi.org/10.1007/BF00290733

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation