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

Authors:
Mehdi Jazayeri
Affiliations:
Synapse Computer Corporation, 801 Buckeye Court, Milpitas, CA
Venue:
Journal of the ACM (JACM)
Year:
1981

Citing 1
Cited 5

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 counter-example for “a simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars”

Journal of the ACM (JACM)
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