Simple computation of LALR(1) lookahead sets

DOI10.1016/0020-0190(89)90079-3zbMath0672.68042OpenAlexW2050179449MaRDI QIDQ1120294

Manuel E. Bermudez, George Logothetis

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90079-3

zbMATH Keywords

context-free grammarFollow setsLALR(1)SLR(1)

Mathematics Subject Classification ID

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

Related Items (1)

On the incremental growth and shrinkage of LR goto-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A practical general method for constructing LR(k) parsers
• Efficient LR(1) parsers
• A new analysis of LALR formalisms
• Methods for Computing LALR( k ) Lookahead
• Efficient Computation of LALR(1) Look-Ahead Sets
• A practical method for constructing LR ( k ) processors
• Simple LR(k) grammars

This page was built for publication: Simple computation of LALR(1) lookahead sets