A note on removing loops from table-driven code generators

DOI10.1016/0020-0190(85)90105-XzbMath0575.68088OpenAlexW2022356036MaRDI QIDQ1064081

Se Man Oh, Joseph C. Park

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90105-x

zbMATH Keywords

loop detectionLALR(1) look-ahead settable-driven code generation

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cites Work

• Methods for Computing LALR( k ) Lookahead
• Efficient Computation of LALR(1) Look-Ahead Sets
• The theory of languages

This page was built for publication: A note on removing loops from table-driven code generators