Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations

Information and Computation

Volumn 154, Issue 1, 1999, Pages 34-91

  Engelfriet, Joost ^a   Maneth, Sebastian ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001975506     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2807     Document Type: Article

References (46)

1. Aho, A. V., and Ullman, J. D. (1971), Translations on a context-free grammar, Inform. and Control 19, 439-475.
2. Bloem, R., and Engelfriet, J. (1998), "A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars," Technical Report 98-02, Leiden University. [To appear in J. Comp. Syst. Sci].
3. Bochmann, G. V. (1976), Semantic evaluation from left to right, Comm. ACM 19, 55-62.
4. Courcelle, B., and Engelfriet, J. (1995), A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars, Math. Systems Theory 28, 515-552.
5. Courcelle, B., and Franchi-Zannettacci, P. (1982), Attribute grammars and recursive program schemes, Theoret. Comput. Sci. 17, 163-191, 235-257.
6. Courcelle, B. (1983), Fundamental properties of infinite trees, Theoret. Comput. Sci. 25, 95-169.
7. Courcelle, B. (1994), Monadic second-order definable graph transductions: A survey, Theoret. Comput. Sci. 126, 53-75.
8. Drewes, F., Kreowski, H.-J., and Habel, A. (1997), Hyperedge replacement graph grammars, in "Handbook of Graph Grammars and Computing by Graph Transformation," (G. Rozenberg, Ed.), Vol. 1, Chap. 2, p. 95-162, World Scientific, Singapore.
9. Drewes, F. (1997), "A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars," Technical Report 3/97, Universität Bremen, [To appear in Theory Comput. Systems]
10. Engelfriet, J., and Filé, G. (1981), The formal power of one-visit attribute grammars, Acta Inform. 16, 275-302.
11. Engelfriet, J., and Heyker, L. (1991), The string-generating power of context-free hypergraph grammars, J. Comp. Syst. Sci. 43, 328-360.
12. Engelfriet, J., and Maneth, S., Tree languages generated by context-free graph grammars. [To appear in "Proc. TAGT '98," Lect. Notes in Comput. Sci., Springer-Verlag, New York/Berlin].
13. Engelfriet, J. (1975), Bottom-up and top-down tree transformations - A comparison, Math. Systems Theory 9(3), 198-231.
14. Engelfriet, J. (1977), Top-down tree transducers with regular look-ahead, Math. Systems Theory 10, 289-303.
15. Engelfriet, J. (1980), Some open questions and recent results on tree transducers and tree languages, in "Formal Language Theory; Perspectives and Open Problems" (R. V. Book, Ed.), Academic Press, New York.
16. Engelfriet, J. (1981), "Tree Transducers and Syntax-Directed Semantics," Technical Report Memorandum 363, Technische Hogeschool Twente. [Also in "Proceedings of 7th Colloquium on Trees in Algebra and Programming (CAAP 1982), Lille, France, 1982."]
17. Engelfriet, J. (1982), Three hierarchies of transducers, Math. Systems Theory 15, 95-125.
18. Engelfriet, J. (1997), Context-free graph grammars, in "Handbook of Formal Languages" (G. Rozenberg and A. Salomaa, Eds.), Vol. 3, Chap. 3, Springer-Verlag, New York/Berlin.
19. Engelfriet, J., and Rozenberg, G. (1997), Node replacement graph grammars, in "Handbook of Graph Grammars and Computing by Graph Transformation" (G. Rozenberg, Ed.), Vol. 1, Chap. 1, pp. 1-94, World Scientific, Singapore.
20. Engelfriet, J., Rozenberg, G., and Slutzki, G. (1980), Tree transducers, L systems, and two-way machines, J. Comput. System Sci. 20, 150-202.
21. Engelfriet, J., and Vogler, H. (1985), Macro tree transducers, J. Comput. System Sci. 31, 71-146.
22. Engelfriet, J., and Vogler, H. (1988), High level tree transducers and iterated pushdown tree transducers, Acta Inform. 26, 131-192.
23. Engelfriet, J., and Vogler, H. (1994), The translation power of top-down tree-to-graph transducers, J. Comput. System Sci. 49, 258-305.
24. Engelfriet, J., and van Oostrom, V. (1997), Logical description of context-free graph languages, J. Comput. System Sci. 55(3), 489-503.
25. Fülöp, Z., Herrmann, F., Vágvölgyi, S., and Vogler, H. (1993), Tree transducers with external functions, Theoret. Comput. Sci. 108, 185-236.
26. Fischer, M. J. (1968), "Grammars with Macro-like Productions," Ph.D. thesis, Harvard University, Cambridge, MA.
27. Franchi-Zannettacci, P. (1982), "Attributes Semantiques et Schemas de Programmes," Ph.D. thesis, Université de Bordeaux I. [Thèse d'Etat]
28. Fülöp, Z. (1981), On attributed tree transducers, Acta Cybern. 5, 261-279.
29. Fülöp, Z., and Vágvölgyi, S. (1995), Attributed tree transducers cannot induce all deterministic bottom-up tree transformations, Inform, and Comput. 116(2), 231-240.
30. Fülöp, Z., and Vogler, H. (1997), "A Characterization of Attributed Tree Transformations," Technical Report TUD/FI97/15, Technical University of Dresden. [To appear in Theory Comput. Systems]
31. Fülöp, Z., and Vogler, H. (1998), "Syntax-Directed Semantics - Formal Models Based on Tree Transducers," EATCS Monographs on Theoretical Computer Science, Springer-Verlag, New York/Berlin.
32. Ganzinger, H. (1983), Increasing modularity and language-independency in automatically generated compilers, Sci. Comput. Programming 3, 223-278.
33. Giegerich, R. (1988), Composition and evaluation of attribute coupled grammars, Acta Informatica 25, 3550-423.
34. Gécseg, F., and Steinby, M. (1984), "Tree Automata," Akadémiai Kiadó, Budapest.
35. Gécseg, F., and Steinby, M. (1997), Tree automata, in "Handbook of Formal Languages" (G. Rozenberg and A. Salomaa, Eds.), Vol. 3, Chap. 1, Springer-Verlag, New York/Berlin.
36. Habel, A. (1992), "Hyperedge Replacement: Grammars and Languages," Lect. Notes in Comput. Sci., Vol. 643, Springer-Verlag, New York/Berlin.
37. Knuth, D. E. (1968), Semantics of context-free languages, Math. Systems Theory 2, 127-145. [Corrections in Math. Systems Theory 5, 95-96. (1971)]
38. Kühnemann, A. (1997), "Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata," Ph.D. thesis, Technical University Dresden.
39. Kühnemann, A. (1998), Benefits of tree transducers for optimizing functional programs, in "Foundations of Software Technology & Theoretical Computer Science - FST & TCS'98, 18th International Conference, Proceedings," Lect. Notes in Comput. Sci., Vol. 1530 (V. Arvind and R. Ramanujam, Eds.), pp. 146-157, Springer-Verlag, New York/Berlin.
40. Kennedy, K., and Warren, S. K. (1976), Automatic generation of efficient evaluators for attribute grammars, in "Conf. Rec. of 3rd Symp. on Principles of Programming Languages," pp. 32-49.
41. Maneth, S. (1998), The generating power of total deterministic tree transducers, Inform. and Comput. 147, 111-144.
42. Raoult, J.-C. (1997), Rational tree relations, Bull. Belg. Math. Soc. 4, 149-176. [See also Recursively defined tree transductions, in "Proc. RTA'93," Lect. Notes in Comput. Sci., Vol. 690, pp. 343-357, Springer-Verlag, New York/Berlin]
43. Raoult, J.-C. (1997), Rational tree relations, Bull. Belg. Math. Soc. 4, 149-176. [See also Recursively defined tree transductions, in "Proc. RTA'93," Lect. Notes in Comput. Sci., Vol. 690, pp. 343-357, Springer-Verlag, New York/Berlin]
44. Seki, H., Matsumura, T., Fujii, M., and Kasami, T (1991), On multiple context-free grammars, Theoret. Comput. Sci. 88, 191-229.
45. van Vugt, N. (1996), Generalized context-free grammars, Master's thesis, Internal Report 96-12, Department of Computer Science, Leiden University.
46. Weir, D. J. (1992), Linear context-free rewriting systems and deterministic tree-walking transducers, in "Proc. 30th Annual Meeting of the Association for Computational Linguists."