Efficient Computation of LALR(1) Look-Ahead Sets

DOI10.1145/69622.357187zbMath0489.68074OpenAlexW1966686491WikidataQ56050690 ScholiaQ56050690MaRDI QIDQ3951576

Franklin L. Deremer, Thomas Pennello

Publication date: 1982

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

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

zbMATH Keywords

context-free grammarefficient algorithmstrongly connected componentBackus-Naur formgrammar debugging

Mathematics Subject Classification ID

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

Related Items

Grammar coverings of a deterministic parser with action conflicts, Recognition is not parsing - SPPF-style parsing from cubic recognisers, 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, Extending lookahead for LR parsers, Practical arbitrary lookahead LR parsing, On the incremental growth and shrinkage of LR goto-graphs, Building language towers with Ziggurat, A general model for fixed look-ahead lr parsers, An improved LALR\((k)\) parser generation for regular right part grammars, The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution, From Tessellations to Table Interpretation, Lar(m, c, l) grammars, LALR(1,1) parser generation for regular right part grammars, Generation of efficient LALR parsers for regular right part grammars, A note on removing loops from table-driven code generators, An efficient computation of right context for LR-based error repair