public class ParseTree extends BaseTree
Modifier and Type | Field and Description |
---|---|
java.util.List |
hiddenTokens |
java.lang.Object |
payload |
INVALID_NODE
Constructor and Description |
---|
ParseTree(java.lang.Object label) |
Modifier and Type | Method and Description |
---|---|
void |
_toStringLeaves(java.lang.StringBuffer buf) |
Tree |
dupNode() |
java.lang.String |
getText() |
int |
getTokenStartIndex()
What is the smallest token index (indexing from 0) for this node
and its children?
|
int |
getTokenStopIndex()
What is the largest token index (indexing from 0) for this node
and its children?
|
int |
getType()
Return a token type; needed for tree parsing
|
void |
setTokenStartIndex(int index) |
void |
setTokenStopIndex(int index) |
java.lang.String |
toInputString()
Print out the leaves of this tree, which means printing original
input back out.
|
java.lang.String |
toString()
Override to say how a node (not a tree) should look as text
|
java.lang.String |
toStringWithHiddenTokens()
Emit a token and all hidden nodes before.
|
addChild, addChildren, createChildrenList, deleteChild, freshenParentAndChildIndexes, freshenParentAndChildIndexes, getAncestor, getAncestors, getCharPositionInLine, getChild, getChildCount, getChildIndex, getChildren, getFirstChildWithType, getLine, getParent, hasAncestor, isNil, replaceChildren, sanityCheckParentAndChildIndexes, sanityCheckParentAndChildIndexes, setChild, setChildIndex, setParent, toStringTree
public java.lang.Object payload
public java.util.List hiddenTokens
public Tree dupNode()
public int getType()
Tree
public java.lang.String getText()
public int getTokenStartIndex()
Tree
public void setTokenStartIndex(int index)
public int getTokenStopIndex()
Tree
public void setTokenStopIndex(int index)
public java.lang.String toString()
BaseTree
public java.lang.String toStringWithHiddenTokens()
public java.lang.String toInputString()
public void _toStringLeaves(java.lang.StringBuffer buf)
Copyright © 2012. All Rights Reserved.