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.meta.*;
+import edu.berkeley.sbp.bind.*;
import edu.berkeley.sbp.tib.*;
+import edu.berkeley.sbp.chr.*;
+import edu.berkeley.sbp.util.*;
+import static edu.berkeley.sbp.meta.MetaGrammar.*;
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];
s = s2;
}
- //MetaGrammar mg0 = new MetaGrammar();
- //mg0.walk(MetaGrammar.meta);
- //System.out.println(mg0);
- Tree<String> res = new CharToken.CharToStringParser(MetaGrammar.make()).parse1(new CharToken.Stream(new InputStreamReader(new FileInputStream(s[0]))));
- MetaGrammar mg = (MetaGrammar)new MetaGrammar().walk(res);
- //System.out.println(mg);
- Union meta = mg.done();
+ System.err.println("parsing " + s[0]);
+ Tree<String> res = new CharParser(MetaGrammar.make()).parse(new FileInputStream(s[0])).expand1();
+ 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 CharToken.CharToStringParser(meta).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", new TestCaseMaker());
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 CharToken.CharToStringParser(testcasegrammar);
+ CharParser parser = new CharParser(testcasegrammar);
if (profile) {
System.out.println("\nready...");
System.in.read();
}
- Forest<String> r2 = parser.parse(cs);
+ System.gc();
+ long now = System.currentTimeMillis();
+ System.err.println("parsing " + s[2]);
+ Forest<String> 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...");
+
+ Tree t = r2.expand1();
+ TestCase[] expanded = (TestCase[])((Functor)t.head()).invoke(t.children());
+ 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());
}
}
+ public static class TestCaseMaker extends AnnotationGrammarBindingResolver {
+ public TestCaseMaker() {
+ super(TestCaseMakerHelper.class);
+ }
+ public static class TestCaseMakerHelper extends MetaGrammarBindings {
+ public static @bind.as("grammaro") @bind.raw Object grammaro(Iterable<Tree> t) {
+ System.out.println("working on " + t);
+ return MetaGrammar.make(t.iterator().next(), "s", new TaggingGrammarBindingResolver());
+ }
+ //public static @bind.as("tca") Object tca(Object[] o) throws IOException {
+ //return new TestCase((String)o[0], (String[])o[1], (Union)o[2], false, false); }
+ public static @bind.as("tca") Object tca(String input, String[] output, Union u) throws IOException {
+ return new TestCase(input, output, u, false, false); }
+ public static @bind.as("tcb") Object tca(String input, Union u) throws IOException {
+ return new TestCase(input, new String[0], u, false, false); }
+ public static @bind.as("ts") TestCase[] go(TestCase[] cases) { return cases; }
+ public static @bind.as("o") Object o(Object[] s) { return s; }
+ }
+ }
+
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.output = output==null ? new String[0] : output;
this.grammar = grammar;
}
public String toString() {
return ret;
}
public boolean execute() throws Exception {
- Forest<String> res = new CharToken.CharToStringParser(grammar).parse(inp);
+ Forest<String> 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<Tree<String>> results = res==null ? new HashSet<Tree<String>>() : 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.print("\r \r");
}
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<String> tree) {
try {
- if ("grammar".equals(tree.head())) { walkChildren(tree); return done("s"); }
+ if ("grammaro".equals(tree.head())) return MetaGrammar.make(tree, "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())) {
+ else if ("testcase".equals(tree.head())) {
String input = string(tree.child(0));
String[] output = tree.numChildren()>2 ? ((String[])walk(tree, 1)) : new String[0];
- boolean tib = "tibcase".equals(tree.head());
- MetaGrammar gram = tib ? new Tib.Grammar() : new MetaGrammar();
- Union grammar = (Union)((MetaGrammar)(gram.walk(tree, tree.numChildren()-1))).done("s");
- return new TestCase(input, output, grammar, tib);
+ 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<ret.length; i++)
+ ret[i] = walk(tree.child(i));
+ return Reflection.lub(ret);
+ }
+ return super.walk(tree);
} catch (Exception e) {
throw new Error(e);
}
}
}
-
private static String pad(int i,String s) { return s.length() >= i ? s : pad(i-1,s)+" "; }
+ public static String string(Tree<String> tree) {
+ String ret = "";
+ if (tree.head()!=null) ret += tree.head();
+ ret += string(tree.children());
+ return ret;
+ }
+ public static String string(Iterable<Tree<String>> children) {
+ String ret = "";
+ for(Tree<String> t : children) ret += string(t);
+ return ret;
+ }
}
-
projects / sbp.git / blobdiff