A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars

@article{Jazayeri1975ASC,
  title={A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars},
  author={Mehdi Jazayeri},
  journal={J. ACM},
  year={1975},
  volume={28},
  pages={715-720}
}
Attribute grammars are an extension of context-free grammars devised by Knuth as a mechanism for including the semantics of a context-free language with the syntax of the language. The circularity problem for a grammar is to determine whether the semantics for all possible sentences (programs) in fact will be well defined. It is proved that this problem is, in general, computationally intractable. Specifically, it is shown that any deterministic algorithm which solves the problem must for… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS