JavaScript is disabled for your browser. Some features of this site may not work without it.
eCommons will become read-only at noon on May 26 for an infrastructure update. Submissions will not be accepted at this time. We anticipate that this update will be completed by June 2 at 5 p.m.
Please contact us at ecommons-admin@cornell.edu if you have questions or concerns.
A Counter-example for "A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars"
Abstract
Jazayeri proposes a simpler construction for use in the proof by Jazayeri, Ogden, and Rounds that the circularity problem for attribute grammars has inherent exponential complexity. The simplification introduces a flaw that invalidates the proof. Correcting the flaw leaves the new construction only slightly simpler than the old.
Date Issued
1987-03Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-815
Type
technical report