import java.io.*;
import java.util.*;
import edu.berkeley.sbp.*;
-import edu.berkeley.sbp.*;
import edu.berkeley.sbp.misc.*;
-import edu.berkeley.sbp.*;
+import edu.berkeley.sbp.tib.*;
+import edu.berkeley.sbp.chr.*;
public class RegressionTests {
public static boolean yes = false;
- public static class MyWalker extends ReflectiveWalker {
- public String top(Object[] o) { return "top("+join(o)+")"; }
- public String str(String[] s) { String ret = ""; for(String st : s) ret += st; return ret; }
- public String join(Object[] o) { String ret = ""; for(Object st : o) ret += st; return ret; }
- public String whilex(Object s, Object y) { return "while("+s+") " + y; }
- public String seq(Object[] statements) {
- String ret = "";
- for(Object s : statements) ret += s + ";\n";
- return ret;
- }
- /*
- public String bl(String s) { return "{" + s + "}"; }
- */
- };
public static void main(String[] s) throws Exception {
try {
//MetaGrammar mg0 = new MetaGrammar();
//mg0.walk(MetaGrammar.meta);
//System.out.println(mg0);
- Tree<String> res = new Parser(MetaGrammar.make(), CharToken.top()).parse1(new CharToken.Stream(new InputStreamReader(new FileInputStream(s[0]))));
+ Tree<String> 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();
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]));
+ res = new CharParser(meta).parse(sis).expand1();
Union testcasegrammar = ((MetaGrammar)new MetaGrammar("ts").walk(res)).done("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<String> r2 = parser.parse(cs);
+ System.gc();
+ long now = System.currentTimeMillis();
+ 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();
}
public static class TestCase {
- public final String input;
+ private final boolean tib;
+ public final String input;
public final String[] output;
public final Union grammar;
- public TestCase(String input, String[] output, Union grammar) {
+ public TestCase(String input, String[] output, Union grammar, boolean tib) throws IOException {
+ this.tib = tib;
this.input = input;
this.output = output;
this.grammar = grammar;
return ret;
}
public boolean execute() throws Exception {
- Forest<String> res = new Parser(grammar,
- CharToken.top()).parse(new CharToken.Stream(new StringReader(input), input.indexOf('\n')==-1?"\""+input+"\": ":""));
+ Forest<String> res = null;
+ ParseFailed pfe = null;
+ try {
+ res = tib
+ ? /*new CharParser(grammar).parse(new Tib(input))*/ null
+ : new CharParser(grammar).parse(new StringReader(input));
+ } catch (ParseFailed pf) {
+ pfe = pf;
+ }
+ //ystem.out.println("res=="+res);
Collection<Tree<String>> results = res==null ? new HashSet<Tree<String>>() : res.expand(false);
System.out.print("\r");
if (results.size() == 0 && 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<String> outs = new HashSet<String>();
if (output != null) for(String s : output) outs.add(s.trim());
for (Tree<String> 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 TestCase[] ts(Object o1, TestCase[] ts, Object o2) { return ts; }
- public TestCase[] ts(TestCase[] ts) { return ts; }
- public TestCase testcase(String input, String[] output, Union grammar) { return new TestCase(input, output, grammar); }
- public TestCase testcase(String input, Union grammar) { return new TestCase(input, new String[0], grammar); }
- public MetaGrammar grammar(Object[] o) { return this; }
- public Object walk(String tag, Object[] args) {
- if ("grammar".equals(tag)) return done("s");
- else return super.walk(tag, args);
+ public Object walk(Tree<String> 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));
+ 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);
+ } else if ("ts".equals(tree.head())) return walk(tree, 0);
+ else return super.walk(tree);
+ } catch (Exception e) {
+ throw new Error(e);
+ }
}
}