Affiliation:
1. Twente Univ. of Technology, Enschede, The Netherlands
Abstract
Theoretical results are presented on multi-pass (both left-to-right and alternating), multi-sweep, and multi-visit attribute grammars. For each of these, a pure type and a simple type are distinguished: The pure attribute grammars are defined by nondeterministic attribute evaluators, and the simple ones by the corresponding (usual) deterministic evaluators. The time complexity of deciding membership in these classes of attribute grammars is studied. In general, this is harder for the pure classes than for the simple ones, for which it is either polynomial or NP-complete. The expressive power of the eight classes is compared by studying the translations they can compute. It is shown that sweeps are more powerful than passes, and visits are more powerful than sweeps.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference40 articles.
1. AHO A. V. SETHI R. AND ULLMAN J.D. Compilers; principles techniques and tools. Addison- Wesley Reading Mass. 1986. AHO A. V. SETHI R. AND ULLMAN J.D. Compilers; principles techniques and tools. Addison- Wesley Reading Mass. 1986.
2. A characterization of attribute evaluation in passes;ALBLAS H;Acta Inf.,1981
3. Finding minimal pass sequences for attribute grammars;ALBLAS H;SIAM J. Comput.,1985
4. Semantic evaluation from left to right
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献