Finding circular attributes in attribute grammars

Journal of the ACM

Volumn 46, Issue 4, 1999, Pages 556-575

  Rodeh, Michael ^a,b,c   Sagiv, Mooly ^a,b,c  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Attribute grammar; Circularity problem; Computational complexity

Indexed keywords

ATTRIBUTE GRAMMARS (AG); CIRCULARITY PROBLEM; FARROW'S ALGORITHM; KNUTH'S ALGORITHM;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

CONTEXT SENSITIVE GRAMMARS;

EID: 0742277320     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/320211.320243     Document Type: Article

References (19)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1985. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, Mass.
2. BARBAR, K. 1982. Étude Comparative de Différentes Classes de Grammaires d'Attributs Ordonnées. Ph.D. dissertation. Université de Bordeaux, Bordeaux, France.
3. DERANSART, P., JOURDAN, M., AND LORHO, B. 1984. Speeding up circularity tests for attribute grammars. Acta Inf. 21, 375-391.
4. DERANSART, P., JOURDAN, M., AND LORHO, B. 1988. Attribute Grammars, Definitions Systems and Bibliography, Chapter I: Definitions and Main Results. In Lecture Notes in Computer Science, vol. 323. Springer-Verlag, New York, pp. 1-52.
5. DILL, J. M. 1989. A counterexample for "A simpler construction for showing the intrinsically exponential complexity of the circularity problems for attribute grammars." J. ACM 36, 1 (Jun.), 92-96.
6. ENGELFRIET, J., AND FILEÉ, G. 1981. Passes and paths of attribute grammars. Inf. Cont. 49, 2, 125-169.
7. FARROW, R. 1986. Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars. In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction, (Palo Alto, Calif., June 25-27). ACM, New York, pp. 85-98.
8. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, Calif.
9. JAZAYERI, M. 1981. A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars. J. ACM 28, 4 (Oct.), 715-720.
10. JAZAYERI, M., OGDEN, W. F., AND ROUNDS, W. C. 1975. The intrinsically exponential complexity of the circularity problem for attribute grammars. Commun. ACM 18, 12 (Dec.), 697-706.
11. JONES, L. G. 1990. Efficient evaluators of circular attribute grammars. ACM Trans. Prog. Lang. Syst. 12, 3 (July), 429-462.
12. JONES, L. G., AND SIMON, J. 1986. Hierarchical VLSI design systems based on attribute grammars. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 58-71.
13. JOURDAN, M., AND PARIGOT, D. 1988. More on speeding up circularity tests for attribute grammars. Rapport RR-828, INRIA, Rocquencourt.
14. KASTENS, U. 1980. Ordered attribute grammars. Acta Inf. 13, 3, 229-256.
15. KASTENS, U., HUTT, B., AND ZIMMERMAN, E. 1982. GAG: A Practical Compiler Generator. In Lecture Notes in Computer Science, vol. 141. Springer Verlag, New York.
16. KNUTH, D. E. 1968. Semantics of context free languages. Math. Syst. Theory 2, 2, 127-145.
17. KNUTH, D. E. 1971. Semantics of context free languages (errata). Math. Syst. Theory 5 1, 95-96.
18. RAIHA, K. J., AND SAARINEN, M. 1982. Testing attribute grammars for circularity. Acta Inf. 17, 2, 185-192.
19. SAGIV, S., EDELSTEIN, O., FRANCEZ, N., AND RODEH, M. 1989. Resolving circularity in attribute grammars with applications to data flow analysis. In Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages (Austin, Tex., Jan. 11-13). ACM, New York, pp. 36-48.