Efficient computation of LALR(1) look-ahead sets-Reference-Cited by-同舟云学术

Efficient computation of LALR(1) look-ahead sets

Published:1979-08 Issue:8 Volume:14 Page:176-187
ISSN:0362-1340
Container-title:ACM SIGPLAN Notices
language:en
Short-container-title:SIGPLAN Not.

Author:

DeRemer Frank¹,Pennello Thomas J.¹

Affiliation:

1. Information Sciences, University of California, Santa Cruz, CA

Abstract

We define two relations that capture the essential structure of the problem of computing LALR(1) look-ahead sets, and present an efficient algorithm to compute the sets in time linear in the size of the relations. In particular, for a PASCAL grammar, our algorithm performs less than 20% of the set unions performed by a popular-compiler (YACC).

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Link

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

Reference12 articles.

1. Aho Alfred V. and Ullman Jeffrey D. The Theory of Parsing Translation and Compiling. Two volumes. Prentice Hall Princeton N.J. 1972. Aho Alfred V. and Ullman Jeffrey D. The Theory of Parsing Translation and Compiling. Two volumes. Prentice Hall Princeton N.J. 1972.

2. EfficientLR (1) parsers

3. Alpern Bowen Martin Chaney Michael Fay Thomas Pennello and Rachel Radin. Translator Writing System for the Burroughs B5700. Information Sciences UC Santa Cruz Santa Cruz CA. 95064. Alpern Bowen Martin Chaney Michael Fay Thomas Pennello and Rachel Radin. Translator Writing System for the Burroughs B5700. Information Sciences UC Santa Cruz Santa Cruz CA. 95064.

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

1. Bibliography;Engineering a Compiler;2023

2. Parsers;Engineering a Compiler;2023

3. Bibliography;Engineering a Compiler;2012

4. Remarks on recent algorithms for LALR lookahead sets;ACM SIGPLAN Notices;1987-04

5. A YACC extension for LRR grammar parsing;Theoretical Computer Science;1987