A characterization of attributed tree transformations by a subclass of macro tree transducers

Theory of Computing Systems

Volumn 32, Issue 6, 1999, Pages 649-676

  Fulop Z ^a   Vogler, H ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TRANSDUCERS;

NON-CIRCULAR; TREE TRANSDUCERS; TREE TRANSFORMATION;

FORESTRY;

EID: 0039444188     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000135     Document Type: Article

References (27)

1. A. Appel. Modern Compiler Implementation in ML. Cambridge University Press, Cambridge, 1997.
2. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximations or fixpoints. In Proceedings of the 4th ACM Symposium on Principle of Programming Language. ACM, New York, 1977.
3. B. Courcelle and P. Franchi-Zannettacci. Attribute grammars and recursive program schemes. Theoret. Comput. Sci., 17:163-191, 235-257, 1982.
4. L. M. Chirica and D. F. Martin. An order-algebraic definition of Knuthian semantics. Math. Systems Theory, 13:1-27, 1979.
5. J. Engelfriet. Some open questions and recent results on tree transducers and tree languages. In R. V. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 241-286. Academic Press, New York, 1980.
6. J. Engelfriet. Tree transducers and syntax-directed semantics. Technical Report Memorandum 363, Technische Hogeschool Twente, 1981. Also in Proceedings of the 7th Colloquium on Trees in Algebra and Programming (CAAP 1992), Lille, France, March 4-6, 1992, pages 82-107.
7. J. Engelfriet and H. Vogler. Macro tree transducers. J. Comput. System Sci., 31:71-146, 1985.
8. P. Franchi-Zannettacci. Attributs semantiques et schemas de programmes. Ph.D. thesis, Universite de Bordeaux I, 1982.
9. Z. Fülöp. On attributed tree transducers. Acta Cybernet., 5:261-279, 1981.
10. Z. Fülöp and H. Vogler. Syntax-Directed Semantics - Formal Models Based on Tree Transducers. Monographs in Theoretical Computer Science, an EATCS Series. Springer-Verlag, Berlin, 1998.
11. H. Ganzinger. Transforming denotational semantics into practical attribute grammars. In N. D. Jones, editor, Semantics-Directed Compiler Generation, pages 1-69. LNCS 94 Springer-Verlag Berlin, 1980.
12. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kialó, Budapest, 1984.
13. G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems. J. Assoc. Comput. Mach., 27:797-821, 1980.
14. E. T. Irons. A syntax directed compiler for ALGOL 60. Comm. ACM, 4:51-55, 1961.
15. D. E. Knuth. Semantics of context-free languages. Math. Systems Theory, 2:127-145, 1968.
16. A. Kühnemann and H. Vogler. Attributgrammatiken. Vieweg-Verlag, Braunschweig, 1997.
17. K. Kennedy and S. K. Warren. Automatic generation of efficient evaluators for attribute grammars. In Conference Record of 3rd Symposium on Principles of Programming Languages, pages 32-49, 1976.
18. R. Loogen. Implementierung funktionaler Programmiersprachen, chapter 6, pages 138-188. Informatik Fachberichte 232. Springer-Verlag, Berlin, 1990.
19. O. L. Madsen. On defining semantics by means of extended attribute grammars. In N. D. Jones, editor, Semantics Directed Compiler Generation, pages 259-299. LNCS 94 Springer-Verlag, Berlin, 1980.
20. P. D. Mosses. Denotational semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 575-631. Elsevier, Amsterdam, 1990.
21. A. Mycroft. Abstract interpretation and optimizing transformations for applicative programs. Ph.D. thesis, University of Edinburgh, 1981.
22. J. Paakki. Attribute grammar paradigms - a high level methodology in language implementation. ACM Comput. Surv., 27(2):196-255, 1995.
23. D. Scott and C. Strachey. Toward a mathematical semantics for computer languages. In J. Fox, editor, Proceedings of the 21st Symposium on Computers and Automata, pages 19-46. Wiley, New York, 1971.
24. J. E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, MA, 1977.
25. C. Strachey. Towards a formal semantics. In Proceedings of the IFIP TC2 Working Conference on Formal Language Description Languages for Computer Programming, pages 198-220. North-Holland, Amsterdam, 1966.
26. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with application to a decision problem of second-order logic. Math. Systems Theory, 2(1):57-81, 1968.
27. R. Wilhelm and D. Maurer. Übersetzerbau - Theorie, Konstruktion, Generierung. Springer-Verlag, Berlin, 1992.