Efficient computation of LALR(1) look-ahead sets

Authors:
Frank DeRemer;Thomas J. Pennello
Affiliations:
Information Sciences, University of California, Santa Cruz, CA;Information Sciences, University of California, Santa Cruz, CA
Venue:
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Year:
1979

Citing 3
Cited 5

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)

Remarks on recent algorithms for LALR lookahead sets

ACM SIGPLAN Notices
The Complexity of LALR(k) Testing

Journal of the ACM (JACM)
Methods for Computing LALR(k) Lookahead

ACM Transactions on Programming Languages and Systems (TOPLAS)
LALR(k) testing is PSPACE-complete

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A new LALR formalism

ACM SIGPLAN Notices

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