Efficient computation of LALR(1) look-ahead sets

Authors:
Thomas J. Pennello;Frank DeRemer
Affiliations:
ARC International, Santa Cruz, CA;Santa Cruz, CA
Venue:
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Year:
2004

Citing 7
Cited 0

Very fast LR parsing

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
RE2C: a more versatile scanner generator

ACM Letters on Programming Languages and Systems (LOPLAS)
Efficient Computation of LALR(1) Look-Ahead Sets

ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstraction mechanisms in CLU

Communications of the ACM
PASCAL user manual and report

PASCAL user manual and report
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Quantified Score

Hi-index	0.00

Visualization

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-compiler (YACC).