public final String input;
public final String[] output;
public final Union grammar;
- public TestCase(String input, String[] output, Union grammar, boolean tib) {
+ public TestCase(String input, String[] output, Union grammar, boolean tib) throws IOException {
this.inp = tib
- ? new CharToken.Stream(new StringReader(input), input.indexOf('\n')==-1?"\""+input+"\": ":"")
- /*: new TibCharToken.Stream(new StringReader(input))*/
- : new CharToken.Stream(new StringReader(input), input.indexOf('\n')==-1?"\""+input+"\": ":"")
- ;
+ ? new Tib(input)
+ : new CharToken.Stream(new StringReader(input), input.indexOf('\n')==-1?"\""+input+"\": ":"");
this.input = input;
this.output = output;
this.grammar = grammar;
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, false); }
- public TestCase testcase(String input, Union grammar) { return new TestCase(input, new String[0], grammar, false); }
- public TestCase tibcase(String input, Union grammar) { return new TestCase(input, new String[0], grammar, false); }
+ 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 ("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);
}
}