A practical method for constructing LR ( k ) processors

DOI10.1145/363269.363281zbMath0183.45503OpenAlexW1972123888MaRDI QIDQ5575116

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

Related Items (12)

Simple computation of LALR(1) lookahead sets ⋮ Suffix languages in Lr parsing ⋮ LR(0) grammars generated by LR(0) parsers ⋮ Error detection in precedence parsers ⋮ Practical arbitrary lookahead LR parsing ⋮ 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

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