Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes. Functions that are defined in terms of these recursion schemes can be combined, reused and transformed in many ways. This flexibility facilitates the specification of complex transformations in a concise manner, which is illustrated with a number of examples.
Lecture Notes in Computer Science: 11th International Conference, Mpc 2012, Madrid, Spain, June 25-27, 2012. Proceedings, 2012, p. 263-299
compiler; tree transducer; deforestation; attribute grammar; syntax-directed; The Faculty of Science
Main Research Area:
Lecture Notes in Computer Science
11th International Conference on Mathematics of Program ConstructionMathematics of Program Construction, 2012