| Interface | Description |
|---|---|
| PositionTrackingStream<T> | |
| Tree |
What does a tree look like? ANTLR has a number of support classes
such as CommonTreeNodeStream that work on these kinds of trees.
|
| TreeAdaptor |
How to create and navigate trees.
|
| TreeFilter.fptr | |
| TreeNodeStream |
A stream of tree nodes, accessing nodes from a tree of some kind
|
| TreeRewriter.fptr | |
| TreeVisitorAction |
How to execute code for node t when a visitor visits node t.
|
| TreeWizard.ContextVisitor |
| Class | Description |
|---|---|
| BaseTree |
A generic tree implementation with no payload.
|
| BaseTreeAdaptor |
A TreeAdaptor that works with any Tree implementation.
|
| BufferedTreeNodeStream |
A buffered stream of tree nodes.
|
| CommonErrorNode |
A node representing erroneous token range in token stream
|
| CommonTree |
A tree node that is wrapper for a Token object.
|
| CommonTreeAdaptor |
A TreeAdaptor that works with any Tree implementation.
|
| CommonTreeNodeStream | |
| ParseTree |
A record of the rules used to match a token sequence.
|
| RewriteRuleElementStream |
A generic list of elements tracked in an alternative to be used in
a -> rewrite rule.
|
| RewriteRuleNodeStream |
Queues up nodes matched on left side of -> in a tree parser.
|
| RewriteRuleSubtreeStream | |
| RewriteRuleTokenStream | |
| TreeFilter |
Cut-n-paste from material I'm not using in the book anymore (edit later
to make sense):
Now, how are we going to test these tree patterns against every
subtree in our original tree? In what order should we visit nodes?
For this application, it turns out we need a simple ``apply once''
rule application strategy and a ``down then up'' tree traversal
strategy.
|
| TreeIterator |
Return a node stream from a doubly-linked tree whose nodes
know what child index they are.
|
| TreeParser |
A parser for a stream of tree nodes.
|
| TreePatternLexer | |
| TreePatternParser | |
| TreeRewriter | |
| TreeRuleReturnScope |
This is identical to the
ParserRuleReturnScope except that
the start property is a tree nodes not Token object
when you are parsing trees. |
| TreeVisitor |
Do a depth first walk of a tree, applying pre() and post() actions
as we discover and finish nodes.
|
| TreeWizard |
Build and navigate trees with this object.
|
| TreeWizard.TreePattern |
When using %label:TOKENNAME in a tree for parse(), we must
track the label.
|
| TreeWizard.TreePatternTreeAdaptor |
This adaptor creates TreePattern objects for use during scan()
|
| TreeWizard.Visitor | |
| TreeWizard.WildcardTreePattern |
| Exception | Description |
|---|---|
| RewriteCardinalityException |
Base class for all exceptions thrown during AST rewrite construction.
|
| RewriteEarlyExitException |
No elements within a (...)+ in a rewrite rule
|
| RewriteEmptyStreamException |
Ref to ID or expr but no tokens in ID stream or subtrees in expr stream
|