Macro Tree Transducers

Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical topics like composition, decomposition, domains, and ranges of the induced translation classes. The extension with regular look-ahead is considered.

[1]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[2]  M. Nivat.  On the interpretation of recursive program schemes , 1974 .

[3]  Victor J. Rayward-Smith,et al.  Hypergrammars: An Extension of Macrogrammars , 1977, J. Comput. Syst. Sci..

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

[5]  Bruno Courcelle,et al.  Attribute Grammars: Theory and Applications , 1981, ICFPC.

[6]  Brenda S. Baker.  Generalized Syntax Directed Translation, Tree Transducers, and Linear Space , 1978, SIAM J. Comput..

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

[8]  Michael J. C. Gordon,et al.  The denotational description of programming languages - an introduction , 1979 .

[9]  Joost Engelfriet.  The Copying Power of One-State Tree Transducers , 1978 .

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

[11]  Werner Damm,et al.  The IO- and OI-Hierarchies , 1982, Theor. Comput. Sci..

[12]  William C. Rounds,et al.  Tree-oriented proofs of some theorems on context-free and indexed languages , 1970, STOC.

[13]  Joost Engelfriet,et al.  Bounded Nesting in Macro Grammars , 1979, Inf. Control..

[14]  Peter J. Downey.  Formal languages and recursion schemes , 1974, TR.

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

[16]  Joost Engelfriet,et al.  IO and OI. I , 1977, J. Comput. Syst. Sci..

[17]  Bruno Courcelle,et al.  Attribute Grammars and Recursive Program Schemes II , 1982, Theor. Comput. Sci..

[18]  Edgar T. Irons.  A syntax directed compiler for ALGOL 60 , 1983, CACM.

[19]  james w.thatcher,et al.  tree automata: an informal survey , 1974 .

[20]  J. Engelfriet,et al.  IO and OI , 1975 .

[21]  Michael J. Fischer,et al.  Grammars with Macro-Like Productions , 1968, SWAT.

[22]  Joost Engelfriet,et al.  Tree transducers, L systems and two-way machines (Extended Abstract) , 1978, J. Comput. Syst. Sci..

[23]  J. Engelfriet.  Top-down tree transducers with regular look-ahead , 1975 .

[24]  Brenda S. Baker,et al.  Composition of Top-Down and Bottom-Up Tree Transductions , 1979, Inf. Control..

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

[26]  Alfred V. Aho,et al.  Nested Stack Automata , 1969, Journal of the ACM.

[27]  S. Ginsburg,et al.  A Characterization of Machine Mappings , 1966, Canadian Journal of Mathematics.

[28]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[29]  T. S. E. Maibaum,et al.  A Generalized Approach to Formal Languages , 1974, J. Comput. Syst. Sci..

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