| Modifier and Type | Field and Description |
|---|---|
| protected Map | treeToUniqueIDMap
System.identityHashCode() is not always unique; we have to track ourselves. |
| protected int |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public void | addChild(Object t, Object child)
Implements org. |
| public Object | becomeRoot(Object newRoot, Object oldRoot)
Implements org. |
| public Object | becomeRoot(Token newRoot, Object oldRoot)
Implements org. |
| public Object | create(int tokenType, Token fromToken)
Implements org. |
| public Object | create(int tokenType, Token fromToken, String text)
Implements org. |
| public Object | create(int tokenType, String text)
Implements org. |
| public abstract Token | createToken(int tokenType, String text)
Tell me how to create a token for use with imaginary token nodes. |
| public abstract Token | |
| public Object | deleteChild(Object t, int i)
Implements org. |
| public Object | dupTree(Object tree)
Implements org. |
| public Object | |
| public Object | errorNode(TokenStream input, Token start, Token stop, RecognitionException e)
Implements org. |
| public Object | getChild(Object t, int i)
Implements org. |
| public int | getChildCount(Object t)
Implements org. |
| public String | |
| public int | getType(Object t)
Implements org. |
| public int | getUniqueID(Object node)
Implements org. |
| public boolean | isNil(Object tree)
Implements org. |
| public Object | nil()
Implements org. |
| public Object | rulePostProcessing(Object root)
Implements org. |
| public void | setChild(Object t, int i, Object child)
Implements org. |
| public void | setText(Object t, String text)
Implements org. |
| public void | setType(Object t, int type)
Implements org. |
| treeToUniqueIDMap | back to summary |
|---|---|
| protected Map<Object, Integer> treeToUniqueIDMap System.identityHashCode() is not always unique; we have to track ourselves. That's ok, it's only for debugging, though it's expensive: we have to create a hashtable with all tree nodes in it. | |
| uniqueNodeID | back to summary |
|---|---|
| protected int uniqueNodeID | |
| BaseTreeAdaptor | back to summary |
|---|---|
| public BaseTreeAdaptor() | |
| addChild | back to summary |
|---|---|
| public void addChild(Object t, Object child) Implements org. Add a child to the tree t. If child is a flat tree (a list), make all in list children of t. Warning if t has no children, but child does and child isNil then you can decide it is ok to move children to t via t.children = child.children; i.e., without copying the array. Just make sure that this is consistent with have the user will build ASTs.
| |
| becomeRoot | back to summary |
|---|---|
| public Object becomeRoot(Object newRoot, Object oldRoot) Implements org. If oldRoot is a nil root, just copy or move the children to newRoot. If not a nil root, make oldRoot a child of newRoot. old=^(nil a b c), new=r yields ^(r a b c) old=^(a b c), new=r yields ^(r ^(a b c)) If newRoot is a nil-rooted single child tree, use the single child as the new root node. old=^(nil a b c), new=^(nil r) yields ^(r a b c) old=^(a b c), new=^(nil r) yields ^(r ^(a b c)) If oldRoot was null, it's ok, just return newRoot (even if isNil). old=null, new=r yields r old=null, new=^(nil r) yields ^(nil r) Return newRoot. Throw an exception if newRoot is not a simple node or nil root with a single child node--it must be a root node. If newRoot is ^(nil x) return x as newRoot. Be advised that it's ok for newRoot to point at oldRoot's children; i.e., you don't have to copy the list. We are constructing these nodes so we should have this control for efficiency.
| |
| becomeRoot | back to summary |
|---|---|
| public Object becomeRoot(Token newRoot, Object oldRoot) Implements org. Doc from org. Create a node for newRoot make it the root of oldRoot. If oldRoot is a nil root, just copy or move the children to newRoot. If not a nil root, make oldRoot a child of newRoot. Return node created for newRoot. Be advised: when debugging ASTs, the DebugTreeAdaptor manually calls create(Token child) and then plain becomeRoot(node, node) because it needs to trap calls to create, but it can't since it delegates to not inherits from the TreeAdaptor.
| |
| create | back to summary |
|---|---|
| public Object create(int tokenType, Token fromToken) Implements org. Doc from org. Create a new node derived from a token, with a new token type. This is invoked from an imaginary node ref on right side of a rewrite rule as IMAG[$tokenLabel]. This should invoke createToken(Token).
| |
| create | back to summary |
|---|---|
| public Object create(int tokenType, Token fromToken, String text) Implements org. Doc from org. Same as create(tokenType,fromToken) except set the text too. This is invoked from an imaginary node ref on right side of a rewrite rule as IMAG[$tokenLabel, "IMAG"]. This should invoke createToken(Token).
| |
| create | back to summary |
|---|---|
| public Object create(int tokenType, String text) Implements org. Doc from org. Create a new node derived from a token, with a new token type. This is invoked from an imaginary node ref on right side of a rewrite rule as IMAG["IMAG"]. This should invoke createToken(int,String).
| |
| createToken | back to summary |
|---|---|
| public abstract Token createToken(int tokenType, String text) Tell me how to create a token for use with imaginary token nodes. For example, there is probably no input symbol associated with imaginary token DECL, but you need to create it as a payload or whatever for the DECL node as in ^(DECL type ID). If you care what the token payload objects' type is, you should override this method and any other createToken variant. | |
| createToken | back to summary |
|---|---|
| public abstract Token createToken(Token fromToken) Tell me how to create a token for use with imaginary token nodes. For example, there is probably no input symbol associated with imaginary token DECL, but you need to create it as a payload or whatever for the DECL node as in ^(DECL type ID). This is a variant of createToken where the new token is derived from an actual real input token. Typically this is for converting '{' tokens to BLOCK etc... You'll see r : lc='{' ID+ '}' -> ^(BLOCK[$lc] ID+) ; If you care what the token payload objects' type is, you should override this method and any other createToken variant. | |
| deleteChild | back to summary |
|---|---|
| public Object deleteChild(Object t, int i) Implements org. Doc from org. Remove ith child and shift children down from right.
| |
| dupTree | back to summary |
|---|---|
| public Object dupTree(Object tree) Implements org. Doc from org. Duplicate tree recursively, using dupNode() for each node
| |
| dupTree | back to summary |
|---|---|
| public Object dupTree(Object t, Object parent) This is generic in the sense that it will work with any kind of tree (not just Tree interface). It invokes the adaptor routines not the tree node routines to do the construction. | |
| errorNode | back to summary |
|---|---|
| public Object errorNode(TokenStream input, Token start, Token stop, RecognitionException e) Implements org. create tree node that holds the start and stop tokens associated with an error. If you specify your own kind of tree nodes, you will likely have to override this method. CommonTree returns Token.INVALID_TOKEN_TYPE if no token payload but you might have to set token type for diff node type. You don't have to subclass CommonErrorNode; you will likely need to subclass your own tree node class to avoid class cast exception.
| |
| getChild | back to summary |
|---|---|
| public Object getChild(Object t, int i) Implements org. Doc from org. Get a child 0..n-1 node
| |
| getChildCount | back to summary |
|---|---|
| public int getChildCount(Object t) Implements org. Doc from org. How many children? If 0, then this is a leaf node
| |
| getText | back to summary |
|---|---|
| public String getText(Object t) Implements org.
| |
| getType | back to summary |
|---|---|
| public int getType(Object t) Implements org. Doc from org. For tree parsing, I need to know the token type of a node
| |
| getUniqueID | back to summary |
|---|---|
| public int getUniqueID(Object node) Implements org. Doc from org. For identifying trees. How to identify nodes so we can say "add node to a prior node"? Even becomeRoot is an issue. Use System.identityHashCode(node) usually.
| |
| isNil | back to summary |
|---|---|
| public boolean isNil(Object tree) Implements org. Doc from org. Is tree considered a nil node used to make lists of child nodes?
| |
| nil | back to summary |
|---|---|
| public Object nil() Implements org. Doc from org. Return a nil node (an empty but non-null node) that can hold a list of element as the children. If you want a flat tree (a list) use "t=adaptor.nil(); t.addChild(x); t.addChild(y);"
| |
| rulePostProcessing | back to summary |
|---|---|
| public Object rulePostProcessing(Object root) Implements org. Transform ^(nil x) to x and nil to null
| |
| setChild | back to summary |
|---|---|
| public void setChild(Object t, int i, Object child) Implements org. Doc from org. Set ith child (0..n-1) to t; t must be non-null and non-nil node
| |
| setText | back to summary |
|---|---|
| public void setText(Object t, String text) Implements org. Doc from org. Node constructors can set the text of a node
| |
| setType | back to summary |
|---|---|
| public void setType(Object t, int type) Implements org. Doc from org. Node constructors can set the type of a node
| |