Package org.antlr.runtime.tree
Class TreeWizard
java.lang.Object
org.antlr.runtime.tree.TreeWizard
Build and navigate trees with this object. Must know about the names
of tokens so you have to pass in a map or array of token names (from which
this class can build the map). I.e., Token DECL means nothing unless the
class can translate it to a token type.
In order to create nodes and navigate, this class needs a TreeAdaptor.
This class can build a token type -> node index for repeated use or for
iterating over the various nodes with a particular type.
This class works in conjunction with the TreeAdaptor rather than moving
all this functionality into the adaptor. An adaptor helps build and
navigate trees using methods. This class helps you do it with string
patterns like "(A B C)". You can create a tree from that pattern or
match subtrees against it.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic interface
static class
When using %label:TOKENNAME in a tree for parse(), we must track the label.static class
This adaptor creates TreePattern objects for use during scan()static class
static class
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionTreeWizard
(String[] tokenNames) TreeWizard
(TreeAdaptor adaptor) During fillBuffer(), we can make a reverse index from a set of token types of interest to the list of indexes into the node stream.TreeWizard
(TreeAdaptor adaptor, String[] tokenNames) TreeWizard
(TreeAdaptor adaptor, Map tokenNameToTypeMap) -
Method Summary
Modifier and TypeMethodDescriptionprotected static boolean
_equals
(Object t1, Object t2, TreeAdaptor adaptor) protected void
Do the work for indexprotected boolean
_parse
(Object t1, TreeWizard.TreePattern tpattern, Map labels) Do the work for parse.protected void
_visit
(Object t, Object parent, int childIndex, int ttype, TreeWizard.ContextVisitor visitor) Do the recursive work for visitcomputeTokenTypes
(String[] tokenNames) Compute a Map<String, Integer> that is an inverted index of tokenNames (which maps int token types to names).Create a tree or node from the indicated tree pattern that closely follows ANTLR tree grammar tree element syntax: (root child1 ...boolean
Compare type, structure, and text of two trees, assuming adaptor in this instance of a TreeWizard.static boolean
equals
(Object t1, Object t2, TreeAdaptor adaptor) Compare t1 and t2; return true if token types/text, structure match exactly.Return a List of tree nodes with token type ttypeReturn a List of subtrees matching pattern.int
getTokenType
(String tokenName) Using the map of token names to token types, return the type.Walk the entire tree and make a node name to nodes mapping.boolean
boolean
Given a pattern like (ASSIGN %lhs:ID %rhs:.) with optional labels on the various nodes and '.' (dot) as the node/subtree wildcard, return true if the pattern matches and fill the labels Map with the labels pointing at the appropriate nodes.void
visit
(Object t, int ttype, TreeWizard.ContextVisitor visitor) Visit every ttype node in t, invoking the visitor.void
visit
(Object t, String pattern, TreeWizard.ContextVisitor visitor) For all subtrees that match the pattern, execute the visit action.
-
Field Details
-
adaptor
-
tokenNameToTypeMap
-
-
Constructor Details
-
TreeWizard
During fillBuffer(), we can make a reverse index from a set of token types of interest to the list of indexes into the node stream. This lets us convert a node pointer to a stream index semi-efficiently for a list of interesting nodes such as function definition nodes (you'll want to seek to their bodies for an interpreter). Also useful for doing dynamic searches; i.e., go find me all PLUS nodes. protected Map tokenTypeToStreamIndexesMap; /** If tokenTypesToReverseIndex set to INDEX_ALL then indexing occurs for all token types. public static final Set INDEX_ALL = new HashSet(); /** A set of token types user would like to index for faster lookup. If this is INDEX_ALL, then all token types are tracked. If null, then none are indexed. protected Set tokenTypesToReverseIndex = null; -
TreeWizard
-
TreeWizard
-
TreeWizard
-
-
Method Details
-
computeTokenTypes
Compute a Map<String, Integer> that is an inverted index of tokenNames (which maps int token types to names). -
getTokenType
Using the map of token names to token types, return the type. -
index
Walk the entire tree and make a node name to nodes mapping. For now, use recursion but later nonrecursive version may be more efficient. Returns Map<Integer, List> where the List is of your AST node type. The Integer is the token type of the node. TODO: save this index so that find and visit are faster -
_index
Do the work for index -
find
Return a List of tree nodes with token type ttype -
find
Return a List of subtrees matching pattern. -
findFirst
-
findFirst
-
visit
Visit every ttype node in t, invoking the visitor. This is a quicker version of the general visit(t, pattern) method. The labels arg of the visitor action method is never set (it's null) since using a token type rather than a pattern doesn't let us set a label. -
_visit
protected void _visit(Object t, Object parent, int childIndex, int ttype, TreeWizard.ContextVisitor visitor) Do the recursive work for visit -
visit
For all subtrees that match the pattern, execute the visit action. The implementation uses the root node of the pattern in combination with visit(t, ttype, visitor) so nil-rooted patterns are not allowed. Patterns with wildcard roots are also not allowed. -
parse
Given a pattern like (ASSIGN %lhs:ID %rhs:.) with optional labels on the various nodes and '.' (dot) as the node/subtree wildcard, return true if the pattern matches and fill the labels Map with the labels pointing at the appropriate nodes. Return false if the pattern is malformed or the tree does not match. If a node specifies a text arg in pattern, then that must match for that node in t. TODO: what's a better way to indicate bad pattern? Exceptions are a hassle -
parse
-
_parse
Do the work for parse. Check to see if the t2 pattern fits the structure and token types in t1. Check text if the pattern has text arguments on nodes. Fill labels map with pointers to nodes in tree matched against nodes in pattern with labels. -
create
Create a tree or node from the indicated tree pattern that closely follows ANTLR tree grammar tree element syntax: (root child1 ... child2). You can also just pass in a node: ID Any node can have a text argument: ID[foo] (notice there are no quotes around foo--it's clear it's a string). nil is a special name meaning "give me a nil node". Useful for making lists: (nil A B C) is a list of A B C. -
equals
Compare t1 and t2; return true if token types/text, structure match exactly. The trees are examined in their entirety so that (A B) does not match (A B C) nor (A (B C)). // TODO: allow them to pass in a comparator TODO: have a version that is nonstatic so it can use instance adaptor I cannot rely on the tree node's equals() implementation as I make no constraints at all on the node types nor interface etc... -
equals
Compare type, structure, and text of two trees, assuming adaptor in this instance of a TreeWizard. -
_equals
-