Skip to main content
SpringerLink
Log in

Noncanonical LALR(1) Parsing

  • Conference paper
Developments in Language Theory (DLT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4036))

Included in the following conference series:

Abstract

This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we present a definition of noncanonical LALR(1) parsers, NLALR(1). The class of grammars accepted by NLALR(1) parsers is a proper superclass of the NSLR(1) and LALR(1) grammar classes. Among the recognized languages are some nondeterministic languages. The proposed parsers retain many of the qualities of canonical LALR(1) parsers: they are deterministic, easy to construct, and run in linear time. We argue that they could provide the basis for a range of powerful noncanonical parsers.

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 54.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. Johnson, S.C.: YACC — yet another compiler compiler. Computing science technical report 32, AT&T Bell Laboratories, Murray Hill, New Jersey (1975)

    Google Scholar 

  2. Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 13(2), 94–102 (1970)

    Article  MATH  Google Scholar 

  3. Tomita, M.: Efficient Parsing for Natural Language. Kluwer Academic Publishers, Dordrecht (1986)

    Google Scholar 

  4. Szymanski, T.G., Williams, J.H.: Noncanonical extensions of bottom-up parsing techniques. SIAM Journal on Computing 5(2), 231–250 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  5. Tai, K.C.: Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems 1(2), 295–320 (1979)

    Article  MATH  Google Scholar 

  6. Charles, P.: A Practical method for Constructing Efficient LALR(k) Parsers with Automatic Error Recovery. PhD thesis, New York University (1991)

    Google Scholar 

  7. Čulik, K., Cohen, R.: LR-Regular grammars—an extension of LR(k) grammars. Journal of Computer and System Sciences 7, 66–96 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bermudez, M.E., Schimpf, K.M.: Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences 41(2), 230–250 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  9. Farré, J., Fortes Gálvez, J.: A bounded-connect construction for LR-regular parsers. In: Wilhelm, R. (ed.) CC 2001. LNCS, vol. 2027, pp. 244–258. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Farré, J., Fortes Gálvez, J.: Bounded-connect noncanonical discriminating-reverse parsers. Theoretical Computer Science 313(1), 73–91 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. DeRemer, F., Pennello, T.: Efficient computation of LALR(1) look-ahead sets. ACM Transactions on Programming Languages and Systems 4(4), 615–649 (1982)

    Article  MATH  Google Scholar 

  12. Schmitz, S.: Noncanonical LALR(1) parsing. Technical Report I3S/RR-2005-21-FR, Laboratoire I3S (2005), http://www.i3s.unice.fr/~mh/RR/2005/RR-05.21-S.SCHMITZ.pdf

  13. Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Parsing of Series in Automatic Computation, vol. I. Prentice Hall, Englewood Cliffs (1972)

    Google Scholar 

  14. Sippu, S., Soisalon-Soininen, E.: Parsing Theory. LR(k) and LL(k) Parsing of EATCS Monographs on Theoretical Computer Science, vol. II. Springer, Heidelberg (1990)

    MATH  Google Scholar 

  15. Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146–160 (1972)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire I3S, Université de Nice, Sophia Antipolis, France

    Sylvain Schmitz

Authors
  1. Sylvain Schmitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, WA 99164, Pullman, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmitz, S. (2006). Noncanonical LALR(1) Parsing. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_10

Download citation

  • DOI: https://doi.org/10.1007/11779148_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35428-4

  • Online ISBN: 978-3-540-35430-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation