Module hime_redist::parsers::subtree
[−]
[src]
Module for AST subtree in parsers
Structs
| SubTree |
Represents a sub-tree in an AST
A sub-tree is composed of a root with its children.
The children may also have children.
The maximum depth of a sub-tree is 2 (root, children and children's children), in which case the root is always a replaceable node.
The internal representation of a sub-tree is based on arrays.
The organization is that a node's children are immediately following it in the array.
For example, the tree |