Abstract.
In this paper we introduce two methods for building LALR parsers for regular right part grammars (RRPGs). Both methods build a parser directly from a grammar, require no extra state or data structure, and can deal with all LALR RRPGs.
The first method is quite simple. For almost all LALR RRPGs, including the majority of grammars with stacking conflicts, parsing actions are similar to those of LALR parsers for usual context free grammars. No extra action is required to recognize a handle in this case. For other LALR RRPGs, the right hand side of a production is checked to recognize a handle.
The second method does not require checking of the right hand side of a production to recognize a handle. Instead, it records the number of conflicts in LR items and in the stack. Unlike previous methods, our method needs no extra data structure.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 23 September 1998 / 16 March 2001
Rights and permissions
About this article
Cite this article
Morimoto, Si., Sassa, M. Yet another generation of LALR parsers for regular right part grammars. Acta Informatica 37, 671–697 (2001). https://doi.org/10.1007/PL00013318
Issue Date:
DOI: https://doi.org/10.1007/PL00013318