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.*;
public class RegressionTests {
}
public static class TestCase {
+ private final Token.Stream inp;
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.inp = tib
+ ? new Tib(input)
+ : new CharToken.Stream(new StringReader(input), input.indexOf('\n')==-1?"\""+input+"\": ":"");
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 = new Parser(grammar, CharToken.top()).parse(inp);
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.println("\r \r");
}
HashSet<String> outs = new HashSet<String>();
- for(String s : output) outs.add(s.trim());
+ if (output != null) for(String s : output) outs.add(s.trim());
boolean bad = false;
for (Tree<String> r : results) {
String s = r.toString().trim();
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, String[] output, Union grammar) throws IOException {
+ return new TestCase(input, output, grammar, false); }
+ public TestCase testcase(String input, Union grammar) throws IOException {
+ return new TestCase(input, new String[0], grammar, false); }
+ public TestCase tibcase(String input, String[] output, Union grammar) throws IOException {
+ return new TestCase(input, output, grammar, true); }
+ public TestCase tibcase(String input, Union grammar) throws IOException {
+ return new TestCase(input, new String[0], grammar, true); }
public MetaGrammar grammar(Object[] o) { return this; }
- public Object walk(String tag, Object[] args) {
- if ("testcase".equals(tag)) {
- if (args.length==2) return testcase((String)args[0], new String[0], (Union)args[1]);
- return testcase((String)args[0], (String[])args[1], (Union)args[2]); }
- else if ("grammar".equals(tag)) return done("s");
- else return super.walk(tag, args);
+
+ public Object walk(Tree<String> tree) {
+ if ("grammar".equals(tree.head())) { walkChildren(tree); return done("s"); }
+ else return super.walk(tree);
}
}