System.out.println("PARSE FAILED");
System.out.print("\033[0m");
} 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;
}
}
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];
- Union grammar = (Union)((MetaGrammar)(new Tib.Grammar().walk(tree, tree.numChildren()-1))).done("s");
- return new TestCase(input, output, grammar, "tibcase".equals(tree.head()));
+ 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) {