public abstract class BaseAST extends Object implements AST, Serializable
| Modifier and Type | Field and Description |
|---|---|
protected BaseAST |
down |
protected BaseAST |
right |
| Constructor and Description |
|---|
BaseAST() |
| Modifier and Type | Method and Description |
|---|---|
void |
addChild(AST node)
Add a node to the end of the child list for this node
|
static String |
decode(String text) |
static String |
encode(String text) |
boolean |
equals(AST t)
Is node t equal to this in terms of token type and text?
|
boolean |
equalsList(AST t)
Is t an exact structural and equals() match of this tree.
|
boolean |
equalsListPartial(AST sub)
Is 'sub' a subtree of this list?
The siblings of the root are NOT ignored.
|
boolean |
equalsTree(AST t)
Is tree rooted at 'this' equal to 't'? The siblings
of 'this' are ignored.
|
boolean |
equalsTreePartial(AST sub)
Is 't' a subtree of the tree rooted at 'this'? The siblings
of 'this' are ignored.
|
ASTEnumeration |
findAll(AST target)
Walk the tree looking for all exact subtree matches.
|
ASTEnumeration |
findAllPartial(AST sub)
Walk the tree looking for all subtrees.
|
int |
getColumn() |
AST |
getFirstChild()
Get the first child of this node; null if not children
|
int |
getLine() |
AST |
getNextSibling()
Get the next sibling in line after this one
|
int |
getNumberOfChildren()
How many children does this node have?
|
String |
getText()
Get the token text for this node
|
static String[] |
getTokenNames()
Return an array of strings that maps token ID to it's text.
|
int |
getType()
Get the token type for this node
|
abstract void |
initialize(AST t) |
abstract void |
initialize(int t,
String txt) |
abstract void |
initialize(Token t) |
void |
removeChildren()
Remove all children
|
void |
setFirstChild(AST c)
Set the first child of a node.
|
void |
setNextSibling(AST n)
Set the next sibling after this one.
|
void |
setText(String text)
Set the token text for this node
|
void |
setType(int ttype)
Set the token type for this node
|
static void |
setVerboseStringConversion(boolean verbose,
String[] names) |
String |
toString() |
String |
toStringList()
Print out a child-sibling tree in LISP notation
|
String |
toStringTree() |
void |
xmlSerialize(Writer out) |
void |
xmlSerializeNode(Writer out) |
void |
xmlSerializeRootClose(Writer out) |
void |
xmlSerializeRootOpen(Writer out) |
public void addChild(AST node)
public int getNumberOfChildren()
getNumberOfChildren in interface ASTpublic boolean equals(AST t)
public boolean equalsList(AST t)
equalsList in interface ASTpublic boolean equalsListPartial(AST sub)
equalsListPartial in interface ASTpublic boolean equalsTree(AST t)
equalsTree in interface ASTpublic boolean equalsTreePartial(AST sub)
equalsTreePartial in interface ASTpublic ASTEnumeration findAll(AST target)
public ASTEnumeration findAllPartial(AST sub)
findAllPartial in interface ASTpublic AST getFirstChild()
getFirstChild in interface ASTpublic AST getNextSibling()
getNextSibling in interface ASTpublic String getText()
public int getType()
public abstract void initialize(int t,
String txt)
initialize in interface ASTpublic abstract void initialize(AST t)
initialize in interface ASTpublic abstract void initialize(Token t)
initialize in interface ASTpublic void removeChildren()
public void setFirstChild(AST c)
ASTsetFirstChild in interface ASTpublic void setNextSibling(AST n)
ASTsetNextSibling in interface ASTpublic void setText(String text)
public void setType(int ttype)
public static void setVerboseStringConversion(boolean verbose,
String[] names)
public static String[] getTokenNames()
public String toString()
public String toStringList()
toStringList in interface ASTpublic String toStringTree()
toStringTree in interface ASTpublic void xmlSerializeNode(Writer out) throws IOException
IOExceptionpublic void xmlSerializeRootOpen(Writer out) throws IOException
IOExceptionpublic void xmlSerializeRootClose(Writer out) throws IOException
IOExceptionpublic void xmlSerialize(Writer out) throws IOException
IOExceptionCopyright © 2017–2019 Eclipse Foundation. All rights reserved.