PL360, a Programming Language for the 360 Computers
Journal of the ACM (JACM)
Methods for Computing LALR(k) Lookahead
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Computation of LALR(1) Look-Ahead Sets
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
PASCAL user manual and report
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
An LALR (1) grammar for (revised) Ada
ACM SIGPLAN Notices
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)
Unifying view of recent LALR(1) lookahead set algorithms
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Remarks on recent algorithms for LALR lookahead sets
ACM SIGPLAN Notices
A note introducing syntax through semantic routines
ACM SIGPLAN Notices
Response to remarks on recent algorithms for LALR lookahead sets
ACM SIGPLAN Notices
Generation of LR parsers by partial evaluation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Error repair with validation in LR-based parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
The traditional LALR analysis is reexamined using a new operator and an associated graph. An improved method that allows factoring out a crucial part of the computation for defining states of LR(0) canonical collection and for computing LALR(1) lookahead sets is presented. This factorization leads to significantly improved algorithms with respect to execution time as well as storage requirements. Experimental results including comparison with other known methods are presented.