From 296d90edb29f5e6e639e055388edb514836c8d62 Mon Sep 17 00:00:00 2001 From: adam Date: Wed, 21 Dec 2005 22:07:05 -0500 Subject: [PATCH] checkpoint darcs-hash:20051222030705-5007d-6bf29fca565349b9b95e18ade4c045510695b4e9.gz --- src/edu/berkeley/sbp/misc/RegressionTests.java | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/src/edu/berkeley/sbp/misc/RegressionTests.java b/src/edu/berkeley/sbp/misc/RegressionTests.java index 50a3942..a88c8a4 100644 --- a/src/edu/berkeley/sbp/misc/RegressionTests.java +++ b/src/edu/berkeley/sbp/misc/RegressionTests.java @@ -117,8 +117,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) { -- 1.7.10.4