Abstract
This paper proposes a simple method for the application of a general model for lookahead parsing to regular right part grammars (RRPG's). Previous approaches have been limited to single LR grammar classes:LR(k) and LALR(k), for example. The present approach, however, makes several simple modifications to a general model of lookahead LR parsing, partitioning RRPG's into a infinite number of LR grammar classes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
