The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars

@article{Jazayeri1975TheIE,
  title={The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars},
  author={Mehdi Jazayeri and William F. Ogden and William C. Rounds},
  journal={Commun. ACM},
  year={1975},
  volume={18},
  pages={697-706}
}
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 139 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

139 Citations

0510'74'84'95'06'17
Citations per Year
Semantic Scholar estimates that this publication has 139 citations based on the available data.

See our FAQ for additional information.