X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2Fmisc%2FRegressionTests.java;h=1fd97f16a78dbda19a3693f576de56132bcb6d36;hp=50a39427013efcf0fb2f8df8d1603d552ae717ed;hb=05a1638649b2c25a1eaf26831b1bad48d73f57ef;hpb=f7dc68eeb40878c12463fc1ed2b4351b2a9fe261 diff --git a/src/edu/berkeley/sbp/misc/RegressionTests.java b/src/edu/berkeley/sbp/misc/RegressionTests.java index 50a3942..1fd97f1 100644 --- a/src/edu/berkeley/sbp/misc/RegressionTests.java +++ b/src/edu/berkeley/sbp/misc/RegressionTests.java @@ -82,7 +82,7 @@ public class RegressionTests { System.out.println("PARSE FAILED"); System.out.print("\033[0m"); } else { - System.out.println("\r \r"); + System.out.print("\r \r"); } HashSet outs = new HashSet(); if (output != null) for(String s : output) outs.add(s.trim()); @@ -90,20 +90,22 @@ public class RegressionTests { for (Tree 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; } } @@ -117,8 +119,10 @@ public class RegressionTests { 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) {