two methods for generating a reach graph at any desired program point, one is a dummy...
authorjjenista <jjenista>
Mon, 11 Oct 2010 19:11:16 +0000 (19:11 +0000)
committerjjenista <jjenista>
Mon, 11 Oct 2010 19:11:16 +0000 (19:11 +0000)
commitd5a016cf0878e31af6b71b4c1ee613b24e02c7f2
treee1d360147055b954cf8f8c9ebbf135033ea95219
parent7033474550adbe3265ca7ffe404c717e760cf865
two methods for generating a reach graph at any desired program point, one is a dummy System method, the other is a dummy FlatNode, turns out dummy FlatNode works fine except that joptimize will optimize it out, could fix that later but its still useful for debugging
14 files changed:
Robust/src/Analysis/Disjoint/DisjointAnalysis.java
Robust/src/Analysis/Disjoint/PointerMethod.java
Robust/src/ClassLibrary/System.java
Robust/src/IR/Flat/BuildCode.java
Robust/src/IR/Flat/BuildFlat.java
Robust/src/IR/Flat/FKind.java
Robust/src/IR/Flat/FlatGenReachNode.java [new file with mode: 0644]
Robust/src/IR/Tree/BuildIR.java
Robust/src/IR/Tree/GenReachNode.java [new file with mode: 0644]
Robust/src/IR/Tree/Kind.java
Robust/src/IR/Tree/SemanticCheck.java
Robust/src/Lex/Keyword.java
Robust/src/Lex/Lexer.java
Robust/src/Parse/java14.cup