Diagnostics on LALR(k) conflicts based on a method for LR(k) testing

DOI10.1007/BF01941463zbMath0472.68048OpenAlexW2055662127MaRDI QIDQ1157919

Ole Lehrmann Madsen, Bent Bruun Kristensen

Publication date: 1981

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01941463

zbMATH Keywords

parser generator21, 270-293 (1981)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Cites Work

• A practical general method for constructing LR(k) parsers
• The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency
• Methods for Computing LALR( k ) Lookahead
• Efficient Computation of LALR(1) Look-Ahead Sets
• On the complexity of LR(k) testing
• Simple LR(k) grammars
• On the translation of languages from left to right
• Unnamed Item