Synthesized and inherited functions - a new computational model for syntax-directed semantics

In this paper we introduce a new formal model for the concept of syntax-directed semantics, called macro attributed tree transducer (for skort: mat tree transducer). This model is based on (noncircular) attributed tree transducers and on macro tree transducers. In the first type of transducer, semantic values are computed by means of meaning names called synthesized attributes, and by means of context names called inherited attributes. Both, synthesized and inherited attributes represent basic semantic values. In the second type of transducer, semantic values are computed by meaning names only which are called states. However, in order to have a means of handling context information, states represent functions over semantic values

[1]  Annegret Habel,et al.  May we introduce to you: hyperedge replacement , 1986, Graph-Grammars and Their Application to Computer Science.

[2]  Joost Engelfriet,et al.  Attribute Grammars: Attribute Evaluation Methods , 1984, Method and tools for compiler construction.

[3]  Sándor Vágvölgyi,et al.  Tree Transducers with External Functions , 1993, Theor. Comput. Sci..

[4]  Edgar T. Irons,et al.  A syntax directed compiler for ALGOL 60 , 1961, CACM.

[5]  Michael J. C. Gordon,et al.  The Denotational Description of Programming Languages , 1979, Springer New York.

[6]  M. Newman.  On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

[7]  Joost Engelfriet,et al.  The Translation Power of Top-Down Tree-to-Graph Transducers , 1994, J. Comput. Syst. Sci..

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

[9]  Thomas Reps,et al.  Programming Techniques and Data Structures , 1981 .

[10]  K. Indermark.  Functional compiler description , 1988 .

[11]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[12]  Christopher Strachey,et al.  Toward a mathematical semantics for computer languages , 1971 .

[13]  Alfred V. Aho,et al.  Translations on a Context-Free Grammar , 1971, Inf. Control..

[14]  Heiko Vogler,et al.  Functional Description of the Contextual Analysis in Block-Structured Programming Languages: A Sase Study of Tree Transducers , 1991, Sci. Comput. Program..

[15]  Ronald V. Book,et al.  Formal language theory : perspectives and open problems , 1980 .

[16]  Thomas W. Reps,et al.  Incremental evaluation for attribute grammars with application to syntax-directed editors , 1981, POPL '81.

[17]  Bruno Courcelle.  An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars , 1987, Theor. Comput. Sci..

[18]  Bruno Courcelle.  Attribute Grammars: Definitions, Analysis of Dependencies, Proof Methods , 1983, Method and tools for compiler construction.

[19]  Thomas Reps,et al.  The Synthesizer Generator: A System for Constructing Language-Based Editors , 1988 .

[20]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..

[21]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

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

[23]  Joost Engelfriet,et al.  SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES , 1980 .

[24]  Sándor Vágvölgyi,et al.  Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations , 1995, Inf. Comput..

[25]  Joost Engelfriet,et al.  The String Generating Power of Context-Free Hypergraph Grammars , 1991, J. Comput. Syst. Sci..

[26]  S. Doaitse Swierstra,et al.  Higher order attribute grammars , 1989, PLDI '89.

[27]  Joost Engelfriet,et al.  Pushdown Machines for the Macro Tree Transducer , 1986, Theor. Comput. Sci..

[28]  Zoltán Fülöp.  On attributed tree transducers , 1981, Acta Cybern..

[29]  James W. Thatcher,et al.  Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..