A new LALR formalism

Authors:
J. C. H. Park
Affiliations:
Korea Advanced Institute of Science and Technology, Chongyangri, Seoul, Korea
Venue:
ACM SIGPLAN Notices
Year:
1982

Citing 5
Cited 0

Methods for Computing LALR(k) Lookahead

ACM Transactions on Programming Languages and Systems (TOPLAS)
Simple LR(k) grammars

Communications of the ACM
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Efficient computation of LALR(1) look-ahead sets

SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
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

A new formalism pertaining to LALR analysis is described which serves the dual purpose of providing efficient algorithms and of facilitating their correctness proofs.