Using the simple tree attributions described in this paper, attribute values can themselves be trees, enabling attribution to be used for tree transformations. Unlike higher-order attribute grammars, simple tree attributions have the property of descriptional composition, which allows a complex transformation to be built up from simpler ones, yet be executed efficiently. In contrast to other formalisms that admit descriptional composition, notably composable attribute grammars, simple tree attributions have the expressive power to handle remote references and recursive syntactic (tree-generating) functions, providing significantly more general forms of attribution and transformation.
CITATION STYLE
Boyland, J., & Graham, S. L. (1994). Composing tree attributions. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages (pp. 375–388). Publ by ACM. https://doi.org/10.1145/174675.177971
Mendeley helps you to discover research relevant for your work.