| Modifier and Type | Field and Description |
|---|---|
| public ATNState | atnState
If we build an ATN, we make AST node point at left edge of ATN construct |
| public Grammar | g
For error msgs, nice to know which grammar this AST lives in |
| public String |
| Access | Constructor and Description |
|---|---|
| public | |
| public | |
| public | |
| public | |
| public | |
| public |
| Modifier and Type | Method and Description |
|---|---|
| public boolean | |
| public GrammarAST | dupNode()
Overrides org. Implements org. |
| public GrammarAST | |
| public List | |
| public String | getAltLabel()
Walk ancestors of this node until we find ALT with alt!=null or leftRecursiveAltInfo!=null. |
| public GrammarAST[] | |
| public CommonTree | |
| public CommonTree | |
| public List | |
| public List | |
| public List | |
| public void | |
| public GrammarAST | |
| public AltAST | |
| public void | |
| public void | |
| public String | |
| public Object |
| atnState | back to summary |
|---|---|
| public ATNState atnState If we build an ATN, we make AST node point at left edge of ATN construct | |
| g | back to summary |
|---|---|
| public Grammar g For error msgs, nice to know which grammar this AST lives in | |
| textOverride | back to summary |
|---|---|
| public String textOverride | |
| GrammarAST | back to summary |
|---|---|
| public GrammarAST() | |
| GrammarAST | back to summary |
|---|---|
| public GrammarAST(Token t) | |
| GrammarAST | back to summary |
|---|---|
| public GrammarAST(GrammarAST node) | |
| GrammarAST | back to summary |
|---|---|
| public GrammarAST(int type) | |
| GrammarAST | back to summary |
|---|---|
| public GrammarAST(int type, Token t) | |
| GrammarAST | back to summary |
|---|---|
| public GrammarAST(int type, Token t, String text) | |
| deleteChild | back to summary |
|---|---|
| public boolean deleteChild(Tree t) | |
| dupNode | back to summary |
|---|---|
| public GrammarAST dupNode() Overrides org. Implements org.
| |
| dupTree | back to summary |
|---|---|
| public GrammarAST dupTree() | |
| getAllChildrenWithType | back to summary |
|---|---|
| public List | |
| getAltLabel | back to summary |
|---|---|
| public String getAltLabel() Walk ancestors of this node until we find ALT with alt!=null or leftRecursiveAltInfo!=null. Then grab label if any. If not a rule element, just returns null. | |
| getChildrenAsArray | back to summary |
|---|---|
| public GrammarAST[] getChildrenAsArray() | |
| getFirstDescendantWithType | back to summary |
|---|---|
| public CommonTree getFirstDescendantWithType(int type) | |
| getFirstDescendantWithType | back to summary |
|---|---|
| public CommonTree getFirstDescendantWithType(BitSet types) | |
| getNodesWithType | back to summary |
|---|---|
| public List | |
| getNodesWithType | back to summary |
|---|---|
| public List | |
| getNodesWithTypePreorderDFS | back to summary |
|---|---|
| public List | |
| getNodesWithTypePreorderDFS_ | back to summary |
|---|---|
| public void getNodesWithTypePreorderDFS_(List<GrammarAST> nodes, IntervalSet types) | |
| getNodeWithTokenIndex | back to summary |
|---|---|
| public GrammarAST getNodeWithTokenIndex(int index) | |
| getOutermostAltNode | back to summary |
|---|---|
| public AltAST getOutermostAltNode() | |
| setText | back to summary |
|---|---|
| public void setText(String text) | |
| setType | back to summary |
|---|---|
| public void setType(int type) | |
| toTokenString | back to summary |
|---|---|
| public String toTokenString() | |
| visit | back to summary |
|---|---|
| public Object visit(GrammarASTVisitor v) | |