On the expressive power of attribute grammars

We examine the possibility of translating an attribute system into a recursive program scheme taking derivation trees as arguments. This is possible if and only if the attribute system is strongly non-circular. The strong non circularity is decidable in polynomial time. Our recursive program schemes allow us to attack the equivalence problem for attribute systems and solve it in a special case properly including the case of purely synthesized systems.

[1]  Brian H. Mayoh,et al.  Attribute Grammars and Mathematical Semantics , 1978, SIAM J. Comput..

[2]  Harald Ganzinger,et al.  On Storage Optimization for Automatically Generated Compilers , 1979, Theoretical Computer Science.

[3]  Bruno Courcelle,et al.  Attribute Grammars and Recursive Program Schemes I , 1982, Theoretical Computer Science.

[4]  Emily P. Friedman,et al.  Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes , 1977, J. Comput. Syst. Sci..

[5]  Mikko Saarinen,et al.  On Constructing Efficient Evaluators for Attribute Grammars , 1978, ICALP.

[6]  Laurian Mircea Chirica.  Contributions to compiler correctness. , 1976 .

[7]  Rainer Parchmann,et al.  IO-Macrolanguages and Attributed Translations , 1977, Inf. Control..

[8]  Bruno Courcelle,et al.  A Representation of Trees by Languages II , 1978, Theor. Comput. Sci..

[9]  Oscar H. IBARm.  Information and Control , 1957, Nature.

[10]  Gregor von Bochmann,et al.  Semantic evaluation from left to right , 1976, CACM.

[11]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[12]  Bruno Courcelle,et al.  On the Equivalence Problem for Attribute Systems , 1982, Inf. Control..

[13]  Ken Kennedy,et al.  Automatic generation of efficient evaluators for attribute grammars , 1976, POPL.

[14]  Bruno Courcelle,et al.  A Representation of Trees by Languages I , 1978, Theor. Comput. Sci..

[15]  Isu Fang,et al.  FOLDS, a declarative formal language definition system , 1972 .