A practical method for constructing LR ( k ) processors

DOI10.1145/363269.363281MaRDI QIDQ5575116zbMATH OpenOpenAlexFDO

Authors A. J. Korenjak

Publication date 1969

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/363269.363281

zbMATH Keywords

computer science and automata

Cited in

(12)

• Simple computation of LALR(1) lookahead sets
• LR(0) grammars generated by LR(0) parsers
• Ambiguity and precedence in syntax description
• An alternative approach to the improvement of LR(k) parsers
• A practical general method for constructing LR(k) parsers
• The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency
• Efficient LR(1) parsers
• Equivalence of programs with structured variables
• Lar(m, c, l) grammars
• Suffix languages in Lr parsing
• Error detection in precedence parsers
• Practical arbitrary lookahead LR parsing

This page was built for publication: A practical method for constructing LR ( k ) processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5575116)