Minimizing the Number of Evaluation Passes for Attribute Grammars

DOI10.1137/0210060zbMath0468.68087OpenAlexW1991022454MaRDI QIDQ3922195

Esko Ukkonen, Kari-Jouko Raeihae

Publication date: 1981

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0210060

zbMATH Keywords

NP-completenessapproximation algorithmsmulti-pass evaluators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

Composition and evaluation of attribute coupled grammars ⋮ The shortest common supersequence problem over binary alphabet is NP- complete

This page was built for publication: Minimizing the Number of Evaluation Passes for Attribute Grammars