Package schrodinger :: Package application :: Package desmond :: Package antlr3 :: Module tree :: Class BaseTreeAdaptor
[hide private]
[frames] | no frames]

Class BaseTreeAdaptor

 object --+    
          |    
TreeAdaptor --+
              |
             BaseTreeAdaptor
Known Subclasses:

@brief A TreeAdaptor that works with any Tree implementation.

Instance Methods [hide private]
 
nil(self)
Return a nil node (an empty but non-null node) that can hold a list of element as the children.
 
errorNode(self, input, start, stop, exc)
create tree node that holds the start and stop tokens associated with an error.
 
isNil(self, tree)
Is tree considered a nil node used to make lists of child nodes?
 
dupTree(self, t, parent=None)
This is generic in the sense that it will work with any kind of tree (not just Tree interface).
 
addChild(self, tree, child)
Add a child to the tree t.
 
becomeRoot(self, newRoot, oldRoot)
If oldRoot is a nil root, just copy or move the children to newRoot.
 
rulePostProcessing(self, root)
Transform ^(nil x) to x and nil to null
 
createFromToken(self, tokenType, fromToken, text=None)
Create a new node derived from a token, with a new token type and (optionally) new text.
 
createFromType(self, tokenType, text)
Create a new node derived from a token, with a new token type.
 
getType(self, t)
For tree parsing, I need to know the token type of a node
 
setType(self, t, type)
Node constructors can set the type of a node
 
getText(self, t)
 
setText(self, t, text)
Node constructors can set the text of a node
 
getChild(self, t, i)
Get a child 0..n-1 node
 
setChild(self, t, i, child)
Set ith child (0..n-1) to t; t must be non-null and non-nil node
 
deleteChild(self, t, i)
Remove ith child and shift children down from right.
 
getChildCount(self, t)
How many children? If 0, then this is a leaf node
 
getUniqueID(self, node)
For identifying trees.
 
createToken(self, fromToken=None, tokenType=None, text=None)
Tell me how to create a token for use with imaginary token nodes.

Inherited from TreeAdaptor: create, createWithPayload, dupNode, getChildIndex, getParent, getToken, getTokenStartIndex, getTokenStopIndex, replaceChildren, setChildIndex, setParent, setTokenBoundaries

Inherited from object: __delattr__, __format__, __getattribute__, __hash__, __init__, __new__, __reduce__, __reduce_ex__, __repr__, __setattr__, __sizeof__, __str__, __subclasshook__

Properties [hide private]

Inherited from object: __class__

Method Details [hide private]

nil(self)

 

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);"

Overrides: TreeAdaptor.nil
(inherited documentation)

errorNode(self, input, start, stop, exc)

 

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.

Overrides: TreeAdaptor.errorNode

isNil(self, tree)

 

Is tree considered a nil node used to make lists of child nodes?

Overrides: TreeAdaptor.isNil
(inherited documentation)

dupTree(self, t, parent=None)

 

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.

Overrides: TreeAdaptor.dupTree

addChild(self, tree, child)

 

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.

Overrides: TreeAdaptor.addChild

becomeRoot(self, newRoot, 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.

  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.

Overrides: TreeAdaptor.becomeRoot

rulePostProcessing(self, root)

 

Transform ^(nil x) to x and nil to null

Overrides: TreeAdaptor.rulePostProcessing

createFromToken(self, tokenType, fromToken, text=None)

 

Create a new node derived from a token, with a new token type and (optionally) new text.

This is invoked from an imaginary node ref on right side of a rewrite rule as IMAG[$tokenLabel] or IMAG[$tokenLabel "IMAG"].

This should invoke createToken(Token).

Overrides: TreeAdaptor.createFromToken
(inherited documentation)

createFromType(self, tokenType, text)

 

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).

Overrides: TreeAdaptor.createFromType
(inherited documentation)

getType(self, t)

 

For tree parsing, I need to know the token type of a node

Overrides: TreeAdaptor.getType
(inherited documentation)

setType(self, t, type)

 

Node constructors can set the type of a node

Overrides: TreeAdaptor.setType
(inherited documentation)

getText(self, t)

 
Overrides: TreeAdaptor.getText

setText(self, t, text)

 

Node constructors can set the text of a node

Overrides: TreeAdaptor.setText
(inherited documentation)

getChild(self, t, i)

 

Get a child 0..n-1 node

Overrides: TreeAdaptor.getChild
(inherited documentation)

setChild(self, t, i, child)

 

Set ith child (0..n-1) to t; t must be non-null and non-nil node

Overrides: TreeAdaptor.setChild
(inherited documentation)

deleteChild(self, t, i)

 

Remove ith child and shift children down from right.

Overrides: TreeAdaptor.deleteChild
(inherited documentation)

getChildCount(self, t)

 

How many children? If 0, then this is a leaf node

Overrides: TreeAdaptor.getChildCount
(inherited documentation)

getUniqueID(self, node)

 

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.

Overrides: TreeAdaptor.getUniqueID
(inherited documentation)

createToken(self, fromToken=None, tokenType=None, text=None)

 

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.