On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars

Pei-Chi Wu

Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata…