Searching for "Transformation Rules and Trees." – sorted by Relevance.
-
Transforming Rules and Trees into Comprehensible Knowledge Structures
- Transforming Rules and Trees into Comprehensible Knowledge Structures Brian R. Gaines Knowledge
- Cited by 15 (3 self) – Add To MetaCart
-
An Approach to Document Structure Transformations
- describes how transformation rules are expressed as rules of a tree transducer. Finally, Section 5
- Cited by 2 (1 self) – Add To MetaCart
-
Program Transformations using ASF+SDF
- transformation rule from left to right consists of a number of steps: ffl The underlying abstract syntax tree
- Cited by 10 (4 self) – Add To MetaCart
-
Knowledge Discovery From Data?
- parameters for 6. B. Gaines, “Transforming Rules and Trees into Comprehensible Knowledge Structures
- Cited by 12 (0 self) – Add To MetaCart
-
Transformation of Documents and Schemas by Patterns and Contextual Conditions
- functions and linear tree homomorphisms, and then de ne transformation rules. Marking Functions. A pattern
- Cited by 34 (4 self) – Add To MetaCart
-
Madeleine Bates
- that produces base trees, a transformer that applies transformational rules to the trees to derive a surface
- Add To MetaCart
-
Using Program Transformation to Secure C Programs Against Buffer Overflows
- . Finally, it applies the transformation rules to the tree. The scope of any rule is a subtree of the tree
- Cited by 6 (0 self) – Add To MetaCart
-
VERSION AUTHOR COMMENT AUTHORS ’ CONTACT INFORMATION
- and matches each model element with a transformation rule ("tree-walker") • S2: the transformation engine
- Add To MetaCart
-
Generation of Distributed Supervisors for Parallel Compilers
- the Syntax Tree according to some specified (syntactical) transformation rules. The engine dependence graph
- Cited by 1 (1 self) – Add To MetaCart

