Circularity Testing of Attribute Grammars Requires Exponential Time: A Simpler Proof
Keyword(s):
Jazayeri, Ogden and Rounds have shown that the high time complexity of Knuth's algorithm for testing attribute grammars for circularity is no accident. It was proved that there is a constant c>0 such that any deterministic Turing Machine which correctly tests for circularity must run for more than 2 ^(cn/log n) steps on infinitely many attribute grammars (AGs) (the size of an AG is the number of symbols required to write it down). The proof was rather complex; the purpose of this note is to provide a simpler one.
2017 ◽
2011 ◽
Vol 14
◽
pp. 34-71
◽
1992 ◽
Vol 06
(02n03)
◽
pp. 211-225
◽
2007 ◽
Vol 18
(04)
◽
pp. 715-725
Keyword(s):
2011 ◽
Vol 22
(02)
◽
pp. 395-409
◽
Keyword(s):