One-pass transformations of attributed program trees
The classical attribute grammar framework can be extended by allowing the specification of tree transformation rules. A tree transformation rule consists of an input template, an output template, enabling conditions which are predicates on attribute instances of the input template, and re-evaluation rules which define the values of attribute instances of the output template. A tree transformation may invalidate attribute instances which are needed for additional transformations. In this paper we investigate whether consecutive tree transformations and attribute re-evaluations are safely possible during a single pass over the derivation tree. This check is made at compiler generation time rather than at compilation time. A graph theoretic characterization of attribute dependencies is given, showing in which cases the recomputation of attribute instances can be done in parallel with tree transformations.
- A note on one-pass evaluation of attribute grammars
- Iteration of transformation passes over attributed program trees
- One-stage tree: end-to-end tree builder and pruner
- scientific article; zbMATH DE number 3864481 (Why is no real title available?)
- scientific article; zbMATH DE number 4155849 (Why is no real title available?)
- scientific article; zbMATH DE number 4155917 (Why is no real title available?)
This page was built for publication: One-pass transformations of attributed program trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079943)