mannpatel/Software-Analysis
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

LCA_JP1_now working as intended for A3

Browse Source
This commit is contained in:
Mann Patel
2025-10-28 19:20:50 -06:00
parent 1d1adf78f8
commit 8639c132a5
2 changed files with 276 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
Assignment-3/javaparser-1.0.0/CFGGraph/CFGEdge.java
View File

@@ -6,6 +6,7 @@ public class CFGEdge extends DefaultEdge {
private boolean path;
private CFGNode from;
private CFGNode to;
private String label;
public CFGEdge() {
this(null, null);
@@ -13,6 +14,28 @@ public class CFGEdge extends DefaultEdge {
public CFGEdge(CFGNode from, CFGNode to) {
this.from = from;
this.to = to;
this.label = "";
}
public void setLabel(String label) {
this.label = label;
}
public String getLabel() {
return this.label;
}
public CFGNode getFrom() {
return this.from;
}
public CFGNode getTo() {
return this.to;
}
@Override
public String toString() {
return label;
}
public void setPath(boolean path) { this.path = path; }

277
Assignment-3/javaparser-1.0.0/LCA_JP1_0_0.java
View File

@@ -1,26 +1,25 @@
import java.io.FileInputStream;
import java.io.File;
import java.beans.Expression;
import java.io.*;
import java.net.*;
import java.util.*;
import japa.parser.JavaParser;
import japa.parser.ast.CompilationUnit;
import japa.parser.ast.body.*;
import japa.parser.ast.visitor.VoidVisitorAdapter;
import japa.parser.ast.stmt.ExpressionStmt;
import japa.parser.ast.body.*;
import japa.parser.ast.stmt.*;
import japa.parser.ast.expr.*;
import java.io.FileInputStream;
import java.io.File;
//graph imports
import org.jgrapht.*;
import org.jgrapht.graph.*;
import org.jgrapht.nio.*;
import org.jgrapht.nio.dot.*;
import org.jgrapht.traverse.*;
import java.io.*;
import java.net.*;
import java.util.*;
import japa.parser.ast.stmt.ExpressionStmt;
import CFGGraph.CFGNode;
import CFGGraph.CFGEdge;
@@ -41,32 +40,258 @@ public class LCA_JP1_0_0 {
}
static class CFGVisitor extends VoidVisitorAdapter<Void> {
private Graph<CFGNode, CFGEdge> currCFG = new DefaultDirectedGraph<>(CFGEdge.class);
private Graph<CFGNode, CFGEdge> currCFG;
private CFGNode currentBlock;
private CFGNode entryNode;
private CFGNode exitNode;
@Override
public void visit(MethodDeclaration n, Void arg) {
CFGNode funcNode = new CFGNode(n.getName());
// Initialize new CFG for this method
currCFG = new DefaultDirectedGraph<>(CFGEdge.class);
// Create entry and exit nodes
entryNode = new CFGNode("ENTRY_" + n.getName());
exitNode = new CFGNode("EXIT_" + n.getName());
currCFG.addVertex(entryNode);
currCFG.addVertex(exitNode);
System.out.println("CFG Building Root: " + n.getName());
//we assign root node
currCFG.addVertex(funcNode);
//update curr node
currentBlock = funcNode;
super.visit(n, arg);
System.out.println(currCFG.toString());
currentBlock = entryNode;
BlockStmt body = n.getBody();
if (body != null) {
visitBlockStmt(body);
}
@Override
public void visit(ExpressionStmt n, Void arg) {
CFGNode exprNode = new CFGNode(n.toString());
if (currentBlock != null && currentBlock != exitNode) {
addEdge(currentBlock, exitNode, "");
}
printCFG(n.getName());
}
private void visitBlockStmt(BlockStmt block) {
List<Statement> stmts = block.getStmts();
if (stmts == null) return;
for (Statement stmt : stmts) {
visitStatement(stmt);
}
}
private void visitStatement(Statement stmt) {
if (stmt instanceof ExpressionStmt) {
visitExpressionStmt((ExpressionStmt) stmt);
} else if (stmt instanceof IfStmt) {
visitIfStmt((IfStmt) stmt);
} else if (stmt instanceof ForStmt) {
visitForStmt((ForStmt) stmt);
} else if (stmt instanceof WhileStmt) {
visitWhileStmt((WhileStmt) stmt);
} else if (stmt instanceof ReturnStmt) {
visitReturnStmt((ReturnStmt) stmt);
} else if (stmt instanceof BlockStmt) {
visitBlockStmt((BlockStmt) stmt);
} else {
// Handle other statement types, generically
CFGNode stmtNode = new CFGNode(stmt.toString().trim());
currCFG.addVertex(stmtNode);
addEdge(currentBlock, stmtNode, "");
currentBlock = stmtNode;
}
}
private void visitExpressionStmt(ExpressionStmt stmt) {
CFGNode exprNode = new CFGNode(stmt.toString().trim());
currCFG.addVertex(exprNode);
//link nodes
super.visit(n, arg);
currCFG.addEdge(currentBlock, exprNode);
addEdge(currentBlock, exprNode, "");
currentBlock = exprNode;
}
private void visitIfStmt(IfStmt stmt) {
// Create condition node, if
CFGNode condNode = new CFGNode("if (" + stmt.getCondition() + ")");
currCFG.addVertex(condNode);
addEdge(currentBlock, condNode, "");
CFGNode mergeNode = new CFGNode("MERGE_IF");
currCFG.addVertex(mergeNode);
// Save the condition node to connect branches
CFGNode savedCond = condNode;
// Then branch
currentBlock = condNode;
CFGNode thenStart = currentBlock;
Statement thenStmt = stmt.getThenStmt();
if (thenStmt != null) {
visitStatement(thenStmt);
}
// Connect then branch to merge
CFGNode thenEnd = currentBlock;
if (thenEnd != null && thenEnd != savedCond) {
addEdge(thenEnd, mergeNode, "");
} else {
addEdge(savedCond, mergeNode, "T");
}
// Else branch
currentBlock = savedCond;
Statement elseStmt = stmt.getElseStmt();
if (elseStmt != null) {
CFGNode elseStart = currentBlock;
visitStatement(elseStmt);
CFGNode elseEnd = currentBlock;
if (elseEnd != null && elseEnd != savedCond) {
addEdge(elseEnd, mergeNode, "");
} else {
addEdge(savedCond, mergeNode, "F");
}
} else {
// No else branch - condition goes directly to merge on false
addEdge(savedCond, mergeNode, "F");
}
currentBlock = mergeNode;
}
private void visitForStmt(ForStmt stmt) {
List<Expression> inits = stmt.getInit();
if (inits != null && !inits.isEmpty()) {
for (Expression init : inits) {
CFGNode initNode = new CFGNode(init.toString());
currCFG.addVertex(initNode);
addEdge(currentBlock, initNode, "");
currentBlock = initNode;
}
}
// Condition node
Expression compare = stmt.getCompare();
String condStr = compare != null ? compare.toString() : "true";
CFGNode condNode = new CFGNode("for (" + condStr + ")");
currCFG.addVertex(condNode);
addEdge(currentBlock, condNode, "");
CFGNode exitLoopNode = new CFGNode("EXIT_FOR");
currCFG.addVertex(exitLoopNode);
// Save condition node
CFGNode savedCond = condNode;
// Loop body
CFGNode bodyEntry = null;
Statement body = stmt.getBody();
if (body != null) {
currentBlock = condNode;
visitStatement(body);
bodyEntry = currentBlock;
}
// Update expressions
List<Expression> updates = stmt.getUpdate();
if (updates != null && !updates.isEmpty()) {
for (Expression update : updates) {
CFGNode updateNode = new CFGNode(update.toString());
currCFG.addVertex(updateNode);
addEdge(currentBlock, updateNode, "");
currentBlock = updateNode;
}
}
// Backedge to condition
addEdge(currentBlock, savedCond, "");
// True: edge from condition to body (will be added via body visit)
// False: edge from condition to exit
addEdge(savedCond, exitLoopNode, "F");
currentBlock = exitLoopNode;
}
private void visitWhileStmt(WhileStmt stmt) {
// Condition node
CFGNode condNode = new CFGNode("while (" + stmt.getCondition() + ")");
currCFG.addVertex(condNode);
addEdge(currentBlock, condNode, "");
CFGNode exitLoopNode = new CFGNode("EXIT_WHILE");
currCFG.addVertex(exitLoopNode);
CFGNode savedCond = condNode;
// Loop body
currentBlock = condNode;
Statement body = stmt.getBody();
if (body != null) {
visitStatement(body);
}
// Back edge to condition
addEdge(currentBlock, savedCond, "");
// True: edge through body (added via visit)
// False: edge to exit
addEdge(savedCond, exitLoopNode, "F");
currentBlock = exitLoopNode;
}
private void visitReturnStmt(ReturnStmt stmt) {
Expression expr = stmt.getExpr();
String returnStr = "return" + (expr != null ? " " + expr.toString() : "");
CFGNode returnNode = new CFGNode(returnStr);
currCFG.addVertex(returnNode);
addEdge(currentBlock, returnNode, "");
addEdge(returnNode, exitNode, "");
currentBlock = null; // Expecting no statements should follow
}
private void addEdge(CFGNode from, CFGNode to, String label) {
if (from == null || to == null) return;
CFGEdge edge = new CFGEdge(from, to);
if (label != null && label.length() > 0) {
edge.setLabel(label);
}
try {
currCFG.addEdge(from, to, edge);
} catch (IllegalArgumentException e) {
// Edge already exists, so this useless space
}
}
private void printCFG(String methodName) {
System.out.println("\nCFG " + methodName + ":");
// Get all vertices then sort by ID
Set<CFGNode> vertexSet = currCFG.vertexSet();
List<CFGNode> nodes = new ArrayList<CFGNode>(vertexSet);
Collections.sort(nodes, new Comparator<CFGNode>() {
public int compare(CFGNode n1, CFGNode n2) {
return n1.getID() - n2.getID();
}
});
for (CFGNode node : nodes) {
System.out.print(" node " + node.getID() + ": " + node.getLabel() + " ");
Set<CFGEdge> outEdges = currCFG.outgoingEdgesOf(node);
for (CFGEdge edge : outEdges) {
CFGNode target = currCFG.getEdgeTarget(edge);
String edgeLabel = edge.getLabel();
if (edgeLabel == null) {
edgeLabel = "";
}
System.out.print("edge " + edgeLabel + " " + target.getID() + "; ");
}
System.out.println();
}
System.out.println();
}
}
}}