The Universality of Higher-Order Attributed Tree Transducers


In this paper we present higher-order attributed tree transducers as a formal computational model for higher-order attribute grammars. The latter is a generalization of the classical concept of attribute grammars in the sense that during attribute evaluation, the input tree can be enlarged by inserting subtrees which were computed during attribute… (More)
DOI: 10.1007/s002240010018


10 Figures and Tables