public class ParseTree extends BaseTree
| Modifier and Type | Field and Description |
|---|---|
List<Token> |
hiddenTokens |
Object |
payload |
INVALID_NODE| Modifier and Type | Method and Description |
|---|---|
void |
_toStringLeaves(StringBuffer buf) |
Tree |
dupNode() |
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) |
String |
toInputString()
Print out the leaves of this tree, which means printing original
input back out.
|
String |
toString()
Override to say how a node (not a tree) should look as text
|
String |
toStringWithHiddenTokens()
Emit a token and all hidden nodes before.
|
addChild, addChildren, createChildrenList, deleteChild, freshenParentAndChildIndexes, freshenParentAndChildIndexes, freshenParentAndChildIndexesDeeply, freshenParentAndChildIndexesDeeply, getAncestor, getAncestors, getCharPositionInLine, getChild, getChildCount, getChildIndex, getChildren, getFirstChildWithType, getLine, getParent, hasAncestor, insertChild, isNil, replaceChildren, sanityCheckParentAndChildIndexes, sanityCheckParentAndChildIndexes, setChild, setChildIndex, setParent, toStringTreepublic ParseTree(Object label)
public Tree dupNode()
public int getType()
Treepublic String getText()
public int getTokenStartIndex()
Treepublic void setTokenStartIndex(int index)
public int getTokenStopIndex()
Treepublic void setTokenStopIndex(int index)
public String toString()
BaseTreepublic String toStringWithHiddenTokens()
public String toInputString()
public void _toStringLeaves(StringBuffer buf)
Copyright © 1992-2013 ANTLR. All Rights Reserved.