Methods for Computing LALR( k ) Lookahead

DOI10.1145/357121.357126zbMath0454.68100OpenAlexW2034782178MaRDI QIDQ3902535

Bent Bruun Kristensen, Ole Lehrmann Madsen

Publication date: 1981

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

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

zbMATH Keywords

compilersLR grammar

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (8)

A Yacc extension for LRR grammar parsing ⋮ Simple computation of LALR(1) lookahead sets ⋮ Suffix languages in Lr parsing ⋮ Diagnostics on LALR(k) conflicts based on a method for LR(k) testing ⋮ Practical arbitrary lookahead LR parsing ⋮ A general model for fixed look-ahead lr parsers ⋮ Lar(m, c, l) grammars ⋮ A note on removing loops from table-driven code generators

This page was built for publication: Methods for Computing LALR( k ) Lookahead