Package org.antlr.runtime.tree
package org.antlr.runtime.tree
-
ClassDescriptionA generic tree implementation with no payload.A TreeAdaptor that works with any Tree implementation.A buffered stream of tree nodes.A node representing erroneous token range in token streamA tree node that is wrapper for a Token object.A TreeAdaptor that works with any Tree implementation.A utility class to generate DOT diagrams (graphviz) from arbitrary trees.A record of the rules used to match a token sequence.Base class for all exceptions thrown during AST rewrite construction.No elements within a (...)+ in a rewrite ruleRef to ID or expr but no tokens in ID stream or subtrees in expr streamA generic list of elements tracked in an alternative to be used in a -> rewrite rule.Queues up nodes matched on left side of -> in a tree parser.What does a tree look like? ANTLR has a number of support classes such as CommonTreeNodeStream that work on these kinds of trees.How to create and navigate trees.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.Return a node stream from a doubly-linked tree whose nodes know what child index they are.A stream of tree nodes, accessing nodes from a tree of some kindA parser for a stream of tree nodes.This is identical to the
ParserRuleReturnScope
except that the start property is a tree nodes notToken
object when you are parsing trees.Do a depth first walk of a tree, applying pre() and post() actions as we discover and finish nodes.How to execute code for node t when a visitor visits node t.Build and navigate trees with this object.When using %label:TOKENNAME in a tree for parse(), we must track the label.This adaptor creates TreePattern objects for use during scan()