Public Member Functions | |
| def | addChild |
| def | deleteChild |
| def | dupNode |
| def | freshenParentAndChildIndexes |
| def | getAncestor |
| def | getAncestors |
| def | getCharPositionInLine |
| def | getChild |
| def | getChildCount |
| def | getChildIndex |
| def | getLine |
| def | getParent |
| def | getText |
| def | getTokenStartIndex |
| def | getTokenStopIndex |
| def | getType |
| def | hasAncestor |
| def | isNil |
| def | replaceChildren |
| def | setChild |
| def | setChildIndex |
| def | setParent |
| def | setTokenStartIndex |
| def | setTokenStopIndex |
| def | toString |
| def | toStringTree |
Detailed Description
@brief Abstract baseclass for tree nodes. What does a tree look like? ANTLR has a number of support classes such as CommonTreeNodeStream that work on these kinds of trees. You don't have to make your trees implement this interface, but if you do, you'll be able to use more support code. NOTE: When constructing trees, ANTLR can build any kind of tree; it can even use Token objects as trees if you add a child list to your tokens. This is a tree node without any payload; just navigation and factory stuff.
Member Function Documentation
| def rve_interface_gen.antlr3.tree.Tree.addChild | ( | self, | |
| t | |||
| ) |
Add t as a child to this node. If t is null, do nothing. If t is nil, add all children of t to this' children.
Reimplemented in rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.deleteChild | ( | self, | |
| i | |||
| ) |
Reimplemented in rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.dupNode | ( | self | ) |
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree.
| def rve_interface_gen.antlr3.tree.Tree.getAncestor | ( | self, | |
| ttype | |||
| ) |
Walk upwards and get first ancestor with this token type.
Reimplemented in rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.getAncestors | ( | self | ) |
Return a list of all ancestors of this node. The first node of list is the root and the last is the parent of this node.
Reimplemented in rve_interface_gen.antlr3.tree.BaseTree.
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree, and rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.getChild | ( | self, | |
| i | |||
| ) |
Reimplemented in rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.getChildCount | ( | self | ) |
Reimplemented in rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.getChildIndex | ( | self | ) |
This node is what child index? 0..n-1
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree, and rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.getLine | ( | self | ) |
In case we don't have a token payload, what is the line for errors?
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree, and rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.getParent | ( | self | ) |
Tree tracks parent and child index now > 3.0
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree, and rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.getText | ( | self | ) |
Reimplemented in rve_interface_gen.antlr3.tree.CommonErrorNode, and rve_interface_gen.antlr3.tree.CommonTree.
What is the smallest token index (indexing from 0) for this node and its children?
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree.
What is the largest token index (indexing from 0) for this node and its children?
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree.
| def rve_interface_gen.antlr3.tree.Tree.getType | ( | self | ) |
Return a token type; needed for tree parsing.
Reimplemented in rve_interface_gen.antlr3.tree.CommonErrorNode, and rve_interface_gen.antlr3.tree.CommonTree.
| def rve_interface_gen.antlr3.tree.Tree.hasAncestor | ( | self, | |
| ttype | |||
| ) |
Walk upwards looking for ancestor with this token type.
Reimplemented in rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.isNil | ( | self | ) |
Indicates the node is a nil node but may still have children, meaning the tree is a flat list.
Reimplemented in rve_interface_gen.antlr3.tree.CommonErrorNode, rve_interface_gen.antlr3.tree.CommonTree, and rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.replaceChildren | ( | self, | |
| startChildIndex, | |||
| stopChildIndex, | |||
| t | |||
| ) |
Delete children from start to stop and replace with t even if t is a list (nil-root tree). num of children can increase or decrease. For huge child lists, inserting children can force walking rest of children to set their childindex; could be slow.
Reimplemented in rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.setChild | ( | self, | |
| i, | |||
| t | |||
| ) |
Set ith child (0..n-1) to t; t must be non-null and non-nil node
Reimplemented in rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.setChildIndex | ( | self, | |
| index | |||
| ) |
This node is what child index? 0..n-1
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree, and rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.setParent | ( | self, | |
| t | |||
| ) |
Tree tracks parent and child index now > 3.0
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree, and rve_interface_gen.antlr3.tree.BaseTree.
| def rve_interface_gen.antlr3.tree.Tree.setTokenStartIndex | ( | self, | |
| index | |||
| ) |
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree.
| def rve_interface_gen.antlr3.tree.Tree.setTokenStopIndex | ( | self, | |
| index | |||
| ) |
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree.
| def rve_interface_gen.antlr3.tree.Tree.toString | ( | self | ) |
| def rve_interface_gen.antlr3.tree.Tree.toStringTree | ( | self | ) |
Reimplemented in rve_interface_gen.antlr3.tree.CommonTree, and rve_interface_gen.antlr3.tree.BaseTree.
The documentation for this class was generated from the following file: