A counter-example for “a simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars”

Authors:
Jens M. Dill
Affiliations:
Cornell Univ., Ithaca, NY
Venue:
Journal of the ACM (JACM)
Year:
1989

Citing 2
Cited 4

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

Journal of the ACM (JACM)
The intrinsically exponential complexity of the circularity problem for attribute grammars

Communications of the ACM

The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction

ACM SIGACT News
A worst case of circularity test algorithms for attribute grammars

ACM Transactions on Programming Languages and Systems (TOPLAS)
Finding circular attributes in attribute grammars

Journal of the ACM (JACM)
On exponential-time completeness of the circularity problem for attribute grammars

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Jazayeri [J. ACM 28, 4 (Oct. 1981), 715-720] proposes a simpler construction for use in the proof by Jazayeri et al. [Commun. ACM 18, 12 (Dec. 1975), 697-706] that the circularity problem for attribute grammars has inherent exponential time complexity. The simplification introduces a flaw that invalidates the proof. The flaw can be corrected, at the cost of eliminating some of the simplification claimed for the new construction.