Efficient full LR(I) parser generation-Reference-Cited by-同舟云学术

Efficient full LR(I) parser generation

Published:1988-12 Issue:12 Volume:23 Page:143-150
ISSN:0362-1340
Container-title:ACM SIGPLAN Notices
language:en
Short-container-title:SIGPLAN Not.

Author:

Spector D.¹

Affiliation:

1. MS 10C-17, Prime Computer, Inc., 500 Old Connecticut Path, Framingham, Massachusetts

Abstract

This paper proposes that full LR(1) parser generators are easier to use than the LALR(1) parser generators commonly in use, and that minimal-state full LR(1) tables are not much larger than LALR(1) tables. A method is presented for the automatic construction of minimal-state full LR(1) parser tables. The method is fast and accurate because it starts with the LR(0) table and resolves lookahead ambiguities as necessary by tracing the LR(0) table and splitting the minimum number of states, and because there is no need for generalized set manipulation.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Link

https://dl.acm.org/doi/pdf/10.1145/57669.57684

Reference11 articles.

1. Building collections of LR(K) items with partial expansion of lookahead strings

2. [Dere69] DeRemer F. L. Practical Translators for LR(K) Languages Doctoral Dissertation MIT 1969. [Dere69] DeRemer F. L. Practical Translators for LR(K) Languages Doctoral Dissertation MIT 1969.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution;Science of Computer Programming;2010-11

2. Suffix languages in Lr parsing;International Journal of Computer Mathematics;1995-01

3. A new parsing method for non-LR(1) grammars;Software: Practice and Experience;1992-05

4. Generation and recognition of formal languages by modifiable grammars;ACM SIGPLAN Notices;1990-12

5. Incremental generation of LR parsers;Computer Languages;1990-01