A TreeAdaptor that works with any Tree implementation.
protected var treeToUniqueIDMap:Dictionary
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.
protected var uniqueNodeID:int = 1
public function addChild(t:Object, child:Object):void
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.
Parameters
public function becomeRoot(newRoot:Object, oldRoot:Object):Object
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.
Parameters
| newRoot:Object |
|
| oldRoot:Object |
Returns
public function create(... args):Object
Parameters
Returns
public function createFromToken(tokenType:int, fromToken:Token, text:String = null):Object
Parameters
| tokenType:int |
|
| fromToken:Token |
|
| text:String (default = null )
|
Returns
public function createFromType(tokenType:int, text:String):Object
Parameters
| tokenType:int |
|
| text:String |
Returns
public function createToken(fromToken:Token):Token
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.
Parameters
Returns
public function createTokenFromType(tokenType:int, text:String):Token
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.
Parameters
| tokenType:int |
|
| text:String |
Returns
public function createWithPayload(payload:Token):Object
Parameters
Returns
public function deleteChild(t:Object, i:int):Object
Parameters
Returns
public function dupNode(t:Object):Object
Parameters
Returns
public function dupTree(tree:Object):Object
Parameters
Returns
public function dupTreeWithParent(t:Object, parent:Object):Object
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.
Parameters
Returns
public function errorNode(input:TokenStream, start:Token, stop:Token, e:RecognitionException):Object
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.
Parameters
Returns
public function getChild(t:Object, i:int):Object
Parameters
Returns
public function getChildCount(t:Object):int
Parameters
Returns
public function getChildIndex(t:Object):int
Parameters
Returns
public function getParent(t:Object):Object
Parameters
Returns
public function getText(t:Object):String
Parameters
Returns
public function getToken(t:Object):Token
Parameters
Returns
public function getTokenStartIndex(t:Object):int
Parameters
Returns
public function getTokenStopIndex(t:Object):int
Parameters
Returns
public function getType(t:Object):int
Parameters
Returns
public function getUniqueID(node:Object):int
Parameters
Returns
public function isNil(tree:Object):Boolean
Parameters
Returns
public function nil():Object
Returns
public function replaceChildren(parent:Object, startChildIndex:int, stopChildIndex:int, t:Object):void
Parameters
| parent:Object |
|
| startChildIndex:int |
|
| stopChildIndex:int |
|
| t:Object |
public function rulePostProcessing(root:Object):Object
Transform ^(nil x) to x and nil to null
Parameters
Returns
public function setChild(t:Object, i:int, child:Object):void
Parameters
| t:Object |
|
| i:int |
|
| child:Object |
public function setChildIndex(t:Object, index:int):void
Parameters
public function setParent(t:Object, parent:Object):void
Parameters
public function setText(t:Object, text:String):void
Parameters
public function setTokenBoundaries(t:Object, startToken:Token, stopToken:Token):void
Parameters
public function setType(t:Object, type:int):void
Parameters