gumtree.spoon.builder.TreeScanner Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of gumtree-spoon-ast-diff Show documentation
Show all versions of gumtree-spoon-ast-diff Show documentation
Computes the AST difference between two Spoon abstract syntax trees using the Gumtree algorithm.
package gumtree.spoon.builder;
import static com.github.gumtreediff.tree.TypeSet.type;
import java.util.Stack;
import com.github.gumtreediff.tree.Tree;
import com.github.gumtreediff.tree.TreeContext;
import com.github.gumtreediff.tree.Type;
import spoon.reflect.code.CtBlock;
import spoon.reflect.code.CtCase;
import spoon.reflect.code.CtLiteral;
import spoon.reflect.code.CtStatementList;
import spoon.reflect.declaration.CtAnnotation;
import spoon.reflect.declaration.CtElement;
import spoon.reflect.path.CtRole;
import spoon.reflect.reference.CtReference;
import spoon.reflect.visitor.CtScanner;
public class TreeScanner extends CtScanner {
public static final String NOTYPE = "";
private final TreeContext treeContext;
private final Stack nodes = new Stack<>();
boolean nolabel = false;
TreeScanner(TreeContext treeContext, Tree root) {
this.treeContext = treeContext;
nodes.push(root);
nolabel = isNoLabelMode();
}
@Override
public void enter(CtElement element) {
if (isToIgnore(element)) {
super.enter(element);
return;
}
String label = null;
String nodeTypeName = getNodeType(element);
if (nolabel)
label = nodeTypeName;
else {
LabelFinder lf = new LabelFinder();
lf.scan(element);
label = lf.label;
}
pushNodeToTree(createNode(nodeTypeName, element, label));
int depthBefore = nodes.size();
new NodeCreator(this).scan(element);
if (nodes.size() != depthBefore) {
// contract: this should never happen
throw new RuntimeException("too many nodes pushed");
}
}
public boolean isNoLabelMode() {
String nolabel = System.getProperty("nolabel");
if (nolabel != null) {
return Boolean.valueOf(nolabel);
}
return false;
}
/**
* Ignore some element from the AST
*
* @param element
* @return
*/
private boolean isToIgnore(CtElement element) {
if (element instanceof CtStatementList && !(element instanceof CtCase)) {
if (element.getRoleInParent() == CtRole.ELSE || element.getRoleInParent() == CtRole.THEN) {
return false;
}
return true;
}
if (element instanceof CtReference && element.getRoleInParent() == CtRole.SUPER_TYPE) {
return false;
}
// We need to ignore the literal in the annotation value because we store them in CtWrapper
if (element instanceof CtLiteral> && element.getParent() instanceof CtAnnotation) {
return true;
}
return element.isImplicit() || element instanceof CtReference;
}
@Override
public void exit(CtElement element) {
if (!isToIgnore(element)) {
nodes.pop();
}
super.exit(element);
}
private void pushNodeToTree(Tree node) {
Tree parent = nodes.peek();
if (parent != null) { // happens when nodes.push(null)
parent.addChild(node);
}
nodes.push(node);
}
void addSiblingNode(Tree node) {
Tree parent = nodes.peek();
if (parent != null) { // happens when nodes.push(null)
parent.addChild(node);
}
}
private String getNodeType(CtElement element) {
String nodeTypeName = NOTYPE;
if (element != null) {
nodeTypeName = getTypeName(element.getClass().getSimpleName());
}
if (element instanceof CtBlock) {
nodeTypeName = element.getRoleInParent().toString();
}
if (element.getRoleInParent() == CtRole.SUPER_TYPE) {
nodeTypeName = "SUPER_TYPE";
}
return nodeTypeName;
}
private Tree createNode(String nodeTypeName, CtElement element, String label) {
Tree newNode = createNode(nodeTypeName, label);
newNode.setMetadata(SpoonGumTreeBuilder.SPOON_OBJECT, element);
element.putMetadata(SpoonGumTreeBuilder.GUMTREE_NODE, newNode);
SpoonGumTreeBuilder.setPosition(newNode, element);
return newNode;
}
private String getTypeName(String simpleName) {
// Removes the "Ct" at the beginning and the "Impl" at the end.
return simpleName.substring(2, simpleName.length() - 4);
}
public Tree createNode(String typeClass, String label) {
Type type = type(typeClass);
return treeContext.createTree(type, label);
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy