X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2Fmisc%2FRegressionTests.java;h=6501727b4c11b69f6a74031cc53d9ab45a847013;hp=beb71107dbd80b1e95d4279091f61398e6708386;hb=acfe58223b9a0f78e64a14a1ca5d5998626ee3fe;hpb=45d799349e635f1a99e3974e4504a43d5a7aaf33 diff --git a/src/edu/berkeley/sbp/misc/RegressionTests.java b/src/edu/berkeley/sbp/misc/RegressionTests.java index beb7110..6501727 100644 --- a/src/edu/berkeley/sbp/misc/RegressionTests.java +++ b/src/edu/berkeley/sbp/misc/RegressionTests.java @@ -11,10 +11,17 @@ import edu.berkeley.sbp.util.*; public class RegressionTests { public static boolean yes = false; + public static boolean graph = false; public static void main(String[] s) throws Exception { try { boolean profile = false; + if (s[0].equals("-graph")) { + graph = true; + String[] s2 = new String[s.length-1]; + System.arraycopy(s, 1, s2, 0, s2.length); + s = s2; + } if (s[0].equals("-profile")) { profile = true; String[] s2 = new String[s.length-1]; @@ -25,13 +32,14 @@ public class RegressionTests { //MetaGrammar mg0 = new MetaGrammar(); //mg0.walk(MetaGrammar.meta); //System.out.println(mg0); + System.err.println("parsing " + s[0]); Tree res = new CharParser(MetaGrammar.make()).parse(new FileInputStream(s[0])).expand1(); - MetaGrammar mg = (MetaGrammar)new MetaGrammar().walk(res); //System.out.println(mg); - Union meta = mg.done(); + Union meta = MetaGrammar.make(res, "s"); + System.err.println("parsing " + s[1]); SequenceInputStream sis = new SequenceInputStream(new FileInputStream(s[0]), new FileInputStream(s[1])); res = new CharParser(meta).parse(sis).expand1(); - Union testcasegrammar = ((MetaGrammar)new MetaGrammar("ts").walk(res)).done("ts"); + Union testcasegrammar = MetaGrammar.make(res, "ts"); if (testcasegrammar==null) return; CharParser parser = new CharParser(testcasegrammar); @@ -41,6 +49,7 @@ public class RegressionTests { } System.gc(); long now = System.currentTimeMillis(); + System.err.println("parsing " + s[2]); Forest r2 = parser.parse(new FileInputStream(s[2])); System.out.println(); System.out.println("elapsed = " + (System.currentTimeMillis()-now) + "ms"); @@ -49,7 +58,26 @@ public class RegressionTests { System.in.read(); System.exit(0); } - for(TestCase tc : (TestCase[])new TestCaseBuilder().walk(r2.expand1())) tc.execute(); + System.err.println("expanding..."); + + TestCase[] expanded = (TestCase[])new TestCaseBuilder().walk(r2.expand1()); + System.err.println("executing..."); + for(TestCase tc : expanded) { + tc.execute(); + /* + String st = "a"; + for(int i=0; i<12; i++) { + //System.out.println("length " + st.length()); + tc.input = st; + long nowy = System.currentTimeMillis(); + GSS.shifts = 0; + GSS.reductions = 0; + tc.execute(); + System.out.println("length " + st.length() + " => " + ((System.currentTimeMillis()-nowy)/1000.0) + " " + GSS.shifts + " " + GSS.reductions); + st = st+st; + } + */ + } } catch (Throwable t) { System.err.println("\n\nexception thrown, class == " + t.getClass().getName()); @@ -63,7 +91,7 @@ public class RegressionTests { public static class TestCase { private final boolean tib; private final boolean jav; - public final String input; + public /*final*/ String input; public final String[] output; public final Union grammar; public TestCase(String input, String[] output, Union grammar, boolean tib, boolean jav) throws IOException { @@ -80,30 +108,32 @@ public class RegressionTests { return ret; } public boolean execute() throws Exception { - if (jav) { - Forest tree = new CharParser(grammar).parse(new StringReader(input)); - FileOutputStream fos = new FileOutputStream("/Users/megacz/Desktop/out.dot"); - PrintWriter p = new PrintWriter(new OutputStreamWriter(fos)); - GraphViz gv = new GraphViz(); - tree.toGraphViz(gv); - gv.dump(p); - p.flush(); - p.close(); - return true; - } Forest res = null; ParseFailed pfe = null; + CharParser parser = new CharParser(grammar); + //parser.helpgc = false; try { res = tib ? /*new CharParser(grammar).parse(new Tib(input))*/ null - : new CharParser(grammar).parse(new StringReader(input)); + : parser.parse(new StringReader(input)); } catch (ParseFailed pf) { pfe = pf; } //ystem.out.println("res=="+res); + + if (graph) { + FileOutputStream fos = new FileOutputStream("out.dot"); + PrintWriter p = new PrintWriter(new OutputStreamWriter(fos)); + GraphViz gv = new GraphViz(); + res.toGraphViz(gv); + gv.dump(p); + p.flush(); + p.close(); + System.out.println(parser); + } Collection> results = res==null ? new HashSet>() : res.expand(false); System.out.print("\r"); - if (results.size() == 0 && output.length > 0) { + if (results == null || (results.size() == 0 && (output!=null && output.length > 0))) { System.out.print("\033[31m"); System.out.println("PARSE FAILED"); System.out.print("\033[0m"); @@ -133,32 +163,37 @@ public class RegressionTests { return true; } System.out.println("\r\033[32mPASS\033[0m "); + return false; } } - public static class TestCaseBuilder extends MetaGrammar { + public static class TestCaseBuilder extends StringWalker { public Object walk(Tree tree) { try { - if ("grammar".equals(tree.head())) { walkChildren(tree); return done("s"); } - else if ("output".equals(tree.head())) return string(tree.children()); - else if ("input".equals(tree.head())) return string(tree.children()); - else if ("javacase".equals(tree.head()) || "tibcase".equals(tree.head()) || "testcase".equals(tree.head())) { - String input = string(tree.child(0)); + if ("grammar".equals(tree.head())) return MetaGrammar.make(tree, "s"); + else if ("output".equals(tree.head())) return MetaGrammar.string(tree.children()); + else if ("input".equals(tree.head())) return MetaGrammar.string(tree.children()); + else if ("testcase".equals(tree.head())) { + String input = MetaGrammar.string(tree.child(0)); String[] output = tree.numChildren()>2 ? ((String[])walk(tree, 1)) : new String[0]; - boolean tib = "tibcase".equals(tree.head()); - boolean jav = "javacase".equals(tree.head()); - MetaGrammar gram = jav ? new JavaGrammar() : tib ? /*new Tib.Grammar()*/null : new MetaGrammar(); - Union grammar = (Union)((MetaGrammar)(gram.walk(tree, tree.numChildren()-1))).done("s"); - return new TestCase(input, output, grammar, tib, jav); + Union grammar = MetaGrammar.make(tree.child(tree.numChildren()-1), "s"); + TestCase tc = new TestCase(input, output, grammar, false, false); + return tc; } else if ("ts".equals(tree.head())) return walk(tree, 0); - else return super.walk(tree); + else if (tree.head() == null) { + Object[] ret = new Object[tree.numChildren()]; + for(int i=0; i= i ? s : pad(i-1,s)+" "; } }