kauron-MITSS/ltd-graph-builder
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Visitador: implemented forStmts

Browse source
This commit is contained in:
Carlos Galindo 2019-03-27 01:57:03 +01:00
parent af1e41c592
commit 709bde80af
Signed by untrusted user who does not match committer: kauron
GPG key ID: 83E68706DEE119A3
1 changed files with 42 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

46
src/main/java/grafos/Visitador.java
View file

@ -2,10 +2,8 @@ package grafos;
import com.github.javaparser.ast.Node; import com.github.javaparser.ast.Node;
import com.github.javaparser.ast.body.MethodDeclaration; import com.github.javaparser.ast.body.MethodDeclaration;
import com.github.javaparser.ast.stmt.DoStmt; import com.github.javaparser.ast.expr.Expression;
import com.github.javaparser.ast.stmt.ExpressionStmt; import com.github.javaparser.ast.stmt.*;
import com.github.javaparser.ast.stmt.IfStmt;
import com.github.javaparser.ast.stmt.WhileStmt;
import com.github.javaparser.ast.visitor.VoidVisitorAdapter; import com.github.javaparser.ast.visitor.VoidVisitorAdapter;
import java.util.Collections; import java.util.Collections;
@ -90,6 +88,46 @@ public class Visitador extends VoidVisitorAdapter<CFG> {
prevNode = Collections.singletonList(n.getCondition()); prevNode = Collections.singletonList(n.getCondition());
} }
@Override
public void visit(ForStmt n, CFG graph) {
// Initialization expressions
if (n.getInitialization() != null) {
for (Expression e : n.getInitialization()) {
graph.addNode(e);
graph.connect(prevNode, e);
prevNode = Collections.singletonList(e);
}
}
// Comparison expression
// TODO: shortcut conditions (||, &&)
if (n.getCompare().isPresent()) {
graph.addNode(n.getCompare().get());
graph.connect(prevNode, n.getCompare().get());
prevNode = Collections.singletonList(n.getCompare().get());
}
// Loop body
n.getBody().accept(this, graph);
// Update expressions
if (n.getUpdate() != null) {
for (Expression e : n.getUpdate()) {
graph.addNode(e);
graph.connect(prevNode, e);
prevNode = Collections.singletonList(e);
}
}
// Connect to comparison expression
if (n.getCompare().isPresent())
graph.connect(prevNode, n.getCompare().get());
else {
// TODO: connect last update / end of loop with first element of loop body
}
// Set comparison as last possible statement
if (n.getCompare().isPresent())
prevNode = Collections.singletonList(n.getCompare().get());
else // There is no comparison, can't exit the loop TODO implement break and continue as way to exit
prevNode = Collections.emptyList();
}
// Visitador de expresiones // Visitador de expresiones
// Cada expresión encontrada genera un nodo en el CFG // Cada expresión encontrada genera un nodo en el CFG
@Override @Override