BaseTree doesn't track child indexes.
Get the children internal List; note that if you directly mess with the list, do so at your own risk.
BaseTree doesn't track parent pointers.
Add t as child of this node.
Warning: if t has no children, but child does and child isNil then this routine moves children to t via t.children = child.children; i.e., without copying the array.
Set the parent and child index values for all child of t
Walk upwards and get first ancestor with this token type.
Walk upwards looking for ancestor with this token type.
Insert child t at child position i (0..n-1) by shifting children i+1..n-1 to the right one position. Set parent / indexes properly but does NOT collapse nil-rooted t's that come in here like addChild.
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.
Print out the leaves of this tree, which means printing original input back out.
Print out a whole tree not just a node
Emit a token and all hidden nodes before. EOF node holds all hidden tokens after last real token.
Generated using TypeDoc
A record of the rules used to match a token sequence. The tokens end up as the leaves of this tree and rule nodes are the interior nodes. This really adds no functionality, it is just an alias for CommonTree that is more meaningful (specific) and holds a String to display for a node.