Abstract.
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 evaluation. We prove the universality of this formalism by showing that the class of functions described by higher-order attributed tree transducers coincides with the class of (partial) recursive tree functions.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received May 12, 1999. Online publication December 5, 2000.
Rights and permissions
About this article
Cite this article
Noll, T., Vogler, H. The Universality of Higher-Order Attributed Tree Transducers . Theory Comput. Systems 34, 45–75 (2000). https://doi.org/10.1007/s002240010018
Published:
Issue Date:
DOI: https://doi.org/10.1007/s002240010018