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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Schmitz, S. (2006). Noncanonical LALR(1) parsing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4036 LNCS, pp. 95–107). Springer Verlag. https://doi.org/10.1007/11779148_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
