X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2Fmisc%2FRegressionTests.java;h=6501727b4c11b69f6a74031cc53d9ab45a847013;hp=50a39427013efcf0fb2f8df8d1603d552ae717ed;hb=acfe58223b9a0f78e64a14a1ca5d5998626ee3fe;hpb=f7dc68eeb40878c12463fc1ed2b4351b2a9fe261 diff --git a/src/edu/berkeley/sbp/misc/RegressionTests.java b/src/edu/berkeley/sbp/misc/RegressionTests.java index 50a3942..6501727 100644 --- a/src/edu/berkeley/sbp/misc/RegressionTests.java +++ b/src/edu/berkeley/sbp/misc/RegressionTests.java @@ -1,17 +1,27 @@ package edu.berkeley.sbp.misc; import java.io.*; import java.util.*; +import java.lang.reflect.*; import edu.berkeley.sbp.*; import edu.berkeley.sbp.misc.*; import edu.berkeley.sbp.tib.*; +import edu.berkeley.sbp.chr.*; +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]; @@ -22,28 +32,52 @@ public class RegressionTests { //MetaGrammar mg0 = new MetaGrammar(); //mg0.walk(MetaGrammar.meta); //System.out.println(mg0); - Tree res = new Parser(MetaGrammar.make(), CharToken.top()).parse1(new CharToken.Stream(new InputStreamReader(new FileInputStream(s[0])))); - MetaGrammar mg = (MetaGrammar)new MetaGrammar().walk(res); + System.err.println("parsing " + s[0]); + Tree res = new CharParser(MetaGrammar.make()).parse(new FileInputStream(s[0])).expand1(); //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 Parser(meta, CharToken.top()).parse1(new CharToken.Stream(new InputStreamReader(sis), "parsing " + s[1] + " using " + s[0])); - Union testcasegrammar = ((MetaGrammar)new MetaGrammar("ts").walk(res)).done("ts"); + res = new CharParser(meta).parse(sis).expand1(); + Union testcasegrammar = MetaGrammar.make(res, "ts"); if (testcasegrammar==null) return; - CharToken.Stream cs = new CharToken.Stream(new InputStreamReader(new FileInputStream(s[2])), "parsing " + s[2] + " using " + s[1]); - Parser parser = new Parser(testcasegrammar, CharToken.top()); + CharParser parser = new CharParser(testcasegrammar); if (profile) { System.out.println("\nready..."); System.in.read(); } - Forest r2 = parser.parse(cs); + 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"); if (profile) { System.out.println("\ndone"); 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()); @@ -55,14 +89,14 @@ public class RegressionTests { } public static class TestCase { - private final Token.Stream inp; - public final String input; + private final boolean tib; + private final boolean jav; + public /*final*/ String input; public final String[] output; public final Union grammar; - public TestCase(String input, String[] output, Union grammar, boolean tib) throws IOException { - this.inp = tib - ? new Tib(input) - : new CharToken.Stream(new StringReader(input), input.indexOf('\n')==-1?"\""+input+"\": ":""); + public TestCase(String input, String[] output, Union grammar, boolean tib, boolean jav) throws IOException { + this.tib = tib; + this.jav = jav; this.input = input; this.output = output; this.grammar = grammar; @@ -74,15 +108,38 @@ public class RegressionTests { return ret; } public boolean execute() throws Exception { - Forest res = new Parser(grammar, CharToken.top()).parse(inp); + 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 + : 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"); + if (pfe != null) pfe.printStackTrace(); } else { - System.out.println("\r \r"); + System.out.print("\r \r"); } HashSet outs = new HashSet(); if (output != null) for(String s : output) outs.add(s.trim()); @@ -90,43 +147,142 @@ public class RegressionTests { for (Tree r : results) { String s = r.toString().trim(); if (outs.contains(s)) { outs.remove(s); continue; } + if (!bad) System.out.println(input); System.out.print("\033[33m"); System.out.println(" GOT: " + s); bad = true; } for(String s : outs) { + if (!bad) System.out.println(input); System.out.print("\033[31m"); System.out.println("EXPECTED: " + s); bad = true; } if (bad) { - System.out.print("\033[0m"); + System.out.println("\033[0m"); return true; } - System.out.println("\033[32mPASS\033[0m"); + 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 ("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]; - Union grammar = (Union)((MetaGrammar)(new Tib.Grammar().walk(tree, tree.numChildren()-1))).done("s"); - return new TestCase(input, output, grammar, "tibcase".equals(tree.head())); + 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 t, Class c) throws Exception { + System.out.println("** build " + c.getName() + " " + t.toPrettyString()); + Object h = t.head(); + if (h instanceof ClassMark) return build2(t, Class.forName(JavaGrammar.class.getName()+"$"+((ClassMark)h).clazz)); + Object o = null; + if (t.numChildren()==0) o = t.head(); + else if (t.head()==null) return build2(t, c); + else if (t.head() instanceof FieldMark) { + return build2(new Tree(null, new Tree[] { t }), c); + } else { + throw new Exception("don't know how to cope: " + c.getName() + " <- " + t.toPrettyString()); + } + return Reflection.rebuild(o, c); + } + private static Object build2(Tree t, Class c) throws Exception { + System.out.println("** build2 " + c.getName() + " " + t.toPrettyString()); + if (!Reflection.isConcrete(c)) { + Field f = c.getField("subclasses"); + if (f==null) throw new Exception("don't know how to cope: " + c.getName() + " <- " + t.toPrettyString()); + Class[] subs = (Class[])f.get(null); + OUTER: for(int i=0; i t2 : t) { + Object o2 = t2.head(); + System.out.println("checking " + o2 + " in " + subs[i].getName()); + if (o2 instanceof FieldMark) { + if (subs[i].getField(((FieldMark)o2).field)==null) continue OUTER; + } + } + c = subs[i]; + break; + } + } + Object o = c.newInstance(); + for(Tree t2 : t) { + Object o2 = t2.head(); + if (o2 instanceof FieldMark) { + FieldMark f = (FieldMark)o2; + Field field = c.getField(ReflectiveWalker.mangle(f.field)); + Object tgt = build(t2.child(0), field.getType()); + System.out.println("setting " + f.field + + " on a " + o.getClass().getName() + + " to " + (tgt==null?"null":tgt.getClass().getName())); + field.set(o, tgt); + } + } + System.out.println("returning a " + o.getClass().getName()); + return o; + } + public static Object build(Tree t) throws Exception { + Object h = t.head(); + if (h instanceof ClassMark) { + ClassMark cm = (ClassMark)h; + Class c = Class.forName(JavaGrammar.class.getName() + "$" + ReflectiveWalker.mangle(cm.clazz)); + return build2(t, c); + } + + return h==null ? null : h.toString(); + } + + public static interface Expr { + public static Class[] subclasses = new Class[] { _plus_.class, num.class }; + } + public static class _plus_ implements Expr { + public Expr left; + public Expr right; + public String toString() { return left + "+" + right; } + } + public static class num implements Expr { + public String val; + public String toString() { return "["+val+"]"; } + } + } + */ private static String pad(int i,String s) { return s.length() >= i ? s : pad(i-1,s)+" "; } }