-// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+// Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
package edu.berkeley.sbp.misc;
import java.io.*;
public static boolean yes = false;
public static boolean graph = false;
- public static File[] includes = new File[] { new File("tests") };
+ public static GrammarAST.ImportResolver resolver = new GrammarAST.ImportResolver() {
+ public InputStream getImportStream(String importname) {
+ try {
+ return new FileInputStream("tests/"+importname);
+ } catch (IOException e) {
+ throw new RuntimeException(e);
+ }
+ }
+ };
public static void main() throws Exception {
- main(new String[] { "tests/meta.g", "tests/testcase.g", "tests/regression.tc" });
+ main(new String[] { null, "tests/testcase.g", "tests/regression.tc" });
}
public static void main(String[] s) throws Exception {
s = s2;
}
- System.err.println("parsing " + s[0]);
- Tree<String> res = new CharParser(MetaGrammar.newInstance()).parse(new FileInputStream(s[0])).expand1();
- Union meta = GrammarBuilder.buildFromAST(res, "s", includes);
+ InputStream metaGrammarStream =
+ s[0] == null
+ ? RegressionTests.class.getClassLoader().getResourceAsStream("edu/berkeley/sbp/meta/meta.g")
+ : new FileInputStream(s[0]);
+ Tree<String> res = new CharParser(GrammarAST.getMetaGrammar()).parse(metaGrammarStream).expand1();
+ Union meta = GrammarAST.buildFromAST(res, "s", resolver);
System.err.println("parsing " + s[1]);
res = new CharParser(meta).parse(new FileInputStream(s[1])).expand1();
- Union testcasegrammar = GrammarBuilder.buildFromAST(res, "s", includes);
+ Union testcasegrammar = GrammarAST.buildFromAST(res, "s", resolver);
if (testcasegrammar==null) return;
CharParser parser = new CharParser(testcasegrammar);
}
System.err.println("expanding...");
- TestCase[] expanded = (TestCase[])new GrammarBuilder(includes, "").walkChildren(r2.expand1());
+ ArrayList<TestCase> cases = new ArrayList<TestCase>();
+ Tree tt = r2.expand1();
+ for(int i=0; i<tt.size(); i++) {
+ Tree t = tt.child(i);
+ String[] expect = new String[t.child(2).size()];
+ for(int j=0; j<t.child(2).size(); j++)
+ expect[j] = stringifyChildren(t.child(2).child(j));
+ cases.add(new TestCase(stringifyChildren(t.child(0)),
+ stringifyChildren(t.child(1)),
+ expect,
+ GrammarAST.buildFromAST(t.child(3), "s", resolver),
+ false,
+ false));
+
+ }
+ TestCase[] expanded = new TestCase[cases.size()];
+ for(int i=0; i<expanded.length; i++)
+ expanded[i] = cases.get(i);
for(TestCase tc : expanded)
tc.execute();
}
}
+ private static String stringifyChildren(Tree t) {
+ StringBuffer sb = new StringBuffer();
+ for(int i=0; i<t.size(); i++) {
+ sb.append(t.child(i).head());
+ sb.append(stringifyChildren(t.child(i)));
+ }
+ return sb.toString();
+ }
+
public static class TestCase {
- private final boolean tib;
private final boolean jav;
public /*final*/ String input;
public final String[] output;
public TestCase(String name, String input, String[] output,
Union grammar, boolean tib, boolean jav) {
- this.tib = tib;
this.name = name;
this.jav = jav;
this.input = input;
ParseFailed pfe = null;
CharParser parser = new CharParser(grammar);
System.out.print(" "+name+"\r");
- //parser.helpgc = false;
try {
- res = tib
- ? /*new CharParser(grammar).parse(new Tib(input))*/ null
- : parser.parse(new StringReader(input));
- } catch (ParseFailed pf) {
- pfe = pf;
- }
- //ystem.out.println("res=="+res);
+ res = parser.parse(new StringReader(input));
+ } catch (ParseFailed pf) { pfe = pf; }
if (graph) {
FileOutputStream fos = new FileOutputStream("out.dot");