src/edu/berkeley/sbp/misc/RegressionTests.java

   1 // Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
   2
   3 package edu.berkeley.sbp.misc;
   4 import java.io.*;
   5 import java.util.*;
   6 import java.lang.reflect.*;
   7 import edu.berkeley.sbp.*;
   8 import edu.berkeley.sbp.meta.*;
   9 import edu.berkeley.sbp.chr.*;
  10 import edu.berkeley.sbp.util.*;
  11
  12 public class RegressionTests {
  13
  14     public static boolean yes = false;
  15     public static boolean graph = false;
  16     public static GrammarAST.ImportResolver resolver = new GrammarAST.ImportResolver() {
  17             public InputStream getImportStream(String importname) {
  18                 try {
  19                     return new FileInputStream("tests/"+importname);
  20                 } catch (IOException e) {
  21                     throw new RuntimeException(e);
  22                 }
  23             }
  24         };
  25
  26     public static void main() throws Exception {
  27         main(new String[] { null, "tests/testcase.g", "tests/regression.tc" });
  28     }
  29
  30     public static void main(String[] s) throws Exception {
  31         try {
  32             boolean profile = false;
  33             if (s[0].equals("-graph")) {
  34                 graph = true;
  35                 String[] s2 = new String[s.length-1];
  36                 System.arraycopy(s, 1, s2, 0, s2.length);
  37                 s = s2;
  38             }
  39             if (s[0].equals("-profile")) {
  40                 profile = true;
  41                 String[] s2 = new String[s.length-1];
  42                 System.arraycopy(s, 1, s2, 0, s2.length);
  43                 s = s2;
  44             }
  45
  46             InputStream metaGrammarStream =
  47                 s[0] == null
  48                 ? RegressionTests.class.getClassLoader().getResourceAsStream("edu/berkeley/sbp/meta/meta.g")
  49                 : new FileInputStream(s[0]);
  50             Tree<String> res = new CharParser(GrammarAST.getMetaGrammar()).parse(metaGrammarStream).expand1();
  51             Union meta = GrammarAST.buildFromAST(res, "s", resolver);
  52             CharParser cp = new CharParser(meta);
  53
  54             System.err.println("serializing grammar to grammar.ser...");
  55             ObjectOutputStream oos = new ObjectOutputStream(new FileOutputStream("grammar.ser"));
  56             oos.writeObject(cp);
  57             oos.close();
  58             System.err.println("deserializing grammar from grammar.ser...");
  59             ObjectInputStream ois = new ObjectInputStream(new FileInputStream("grammar.ser"));
  60             cp = (CharParser)ois.readObject();
  61             ois.close();
  62
  63             System.err.println("parsing " + s[1]);
  64             res = new CharParser(meta).parse(new FileInputStream(s[1])).expand1();
  65
  66             Union testcasegrammar = GrammarAST.buildFromAST(res, "s", resolver);
  67             if (testcasegrammar==null) return;
  68             CharParser parser = new CharParser(testcasegrammar);
  69
  70             if (profile) {
  71                 System.out.println("\nready...");
  72                 System.in.read();
  73             }
  74             System.gc();
  75             long now = System.currentTimeMillis();
  76             System.err.println("parsing " + s[2]);
  77             Forest<String> r2 = parser.parse(new FileInputStream(s[2]));
  78             System.out.println();
  79             System.out.println("elapsed = " + (System.currentTimeMillis()-now) + "ms");
  80             if (profile) {
  81                 System.out.println("\ndone");
  82                 System.in.read();
  83                 System.exit(0);
  84             }
  85             System.err.println("expanding...");
  86
  87             ArrayList<TestCase> cases = new ArrayList<TestCase>();
  88             Tree tt = r2.expand1();
  89             for(int i=0; i<tt.size(); i++) {
  90                 Tree t = tt.child(i);
  91                 String[] expect = new String[t.child(2).size()];
  92                 for(int j=0; j<t.child(2).size(); j++)
  93                     expect[j] = stringifyChildren(t.child(2).child(j));
  94                 cases.add(new TestCase(stringifyChildren(t.child(0)),
  95                                        stringifyChildren(t.child(1)),
  96                                        expect,
  97                                        GrammarAST.buildFromAST(t.child(3), "s", resolver),
  98                                        false,
  99                                        false));
 100
 101             }
 102             TestCase[] expanded = new TestCase[cases.size()];
 103             for(int i=0; i<expanded.length; i++)
 104                 expanded[i] = cases.get(i);
 105             for(TestCase tc : expanded)
 106                 tc.execute();
 107
 108         } catch (Throwable t) {
 109             System.err.println("\n\nexception thrown, class == " + t.getClass().getName());
 110             System.err.println(t);
 111             System.err.println();
 112             t.printStackTrace();
 113             System.err.println();
 114         }
 115     }
 116
 117     private static String stringifyChildren(Tree t) {
 118         StringBuffer sb = new StringBuffer();
 119         for(int i=0; i<t.size(); i++) {
 120             sb.append(t.child(i).head());
 121             sb.append(stringifyChildren(t.child(i)));
 122         }
 123         return sb.toString();
 124     }
 125
 126     public static class TestCase {
 127         private final boolean jav;
 128         public /*final*/ String input;
 129         public final String[] output;
 130         public final Union grammar;
 131         public final String name;
 132
 133         public TestCase(String name, String input, String[] output,
 134                         Union grammar, boolean tib, boolean jav) {
 135             this.name = name;
 136             this.jav = jav;
 137             this.input = input;
 138             this.output = output==null ? new String[0] : output;
 139             this.grammar = grammar;
 140         }
 141         public String toString() {
 142             String ret = "testcase {\n" + "  input \""+input+"\";\n";
 143             for(String s : output) ret += "  output \""+s+"\";\n";
 144             ret += grammar +"\n}\n";
 145             return ret;
 146         }
 147         public boolean execute() throws Exception {
 148             Forest<String> res = null;
 149             ParseFailed pfe = null;
 150             CharParser parser = new CharParser(grammar);
 151             System.out.print("     "+name+"\r");
 152             try {
 153                 res = parser.parse(new StringReader(input));
 154             } catch (ParseFailed pf) { pfe = pf; }
 155
 156             if (graph) {
 157                 FileOutputStream fos = new FileOutputStream("out.dot");
 158                 PrintWriter p = new PrintWriter(new OutputStreamWriter(fos));
 159                 GraphViz gv = new GraphViz();
 160                 res.toGraphViz(gv);
 161                 gv.dump(p);
 162                 p.flush();
 163                 p.close();
 164                 System.out.println(parser);
 165             }
 166
 167             Iterable<Tree<String>> results =
 168                 res==null ? new HashSet<Tree<String>>() : res.expand();
 169
 170             System.out.print("\r");
 171             if (results == null || (!results.iterator().hasNext() && (output!=null && output.length > 0))) {
 172                 System.out.print("\033[31m");
 173                 System.out.print("FAIL ");
 174                 System.out.println("\033[0m "+name);
 175                 if (pfe != null) pfe.printStackTrace();
 176             } else {
 177                 System.out.print("\r                                                                                                              \r");
 178             }
 179             HashSet<String> outs = new HashSet<String>();
 180             if (output != null) for(String s : output) outs.add(s.trim());
 181             boolean bad = false;
 182             for (Tree<String> r : results) {
 183                 String s = r.toString().trim();
 184                 if (outs.contains(s)) { outs.remove(s); continue; }
 185                 if (!bad) System.out.println(input);
 186                 System.out.print("\033[33m");
 187                 System.out.println("     GOT: " + s);
 188                 bad = true;
 189             }
 190             for(String s : outs) {
 191                 if (!bad) System.out.println(input);
 192                 System.out.print("\033[31m");
 193                 System.out.println("EXPECTED: " + s);
 194                 bad = true;
 195             }
 196             if (bad) {
 197                 System.out.println("\033[0m");
 198                 return true;
 199             }
 200             System.out.println("\r\033[32mPASS\033[0m "+name);
 201
 202             return false;
 203         }
 204     }
 205
 206     private static String pad(int i,String s) { return s.length() >= i ? s : pad(i-1,s)+" "; }
 207     public static String string(Tree<String> tree) {
 208         String ret = "";
 209         if (tree.head()!=null) ret += tree.head();
 210         ret += string(tree.children());
 211         return ret;
 212     }
 213     public static String string(Iterable<Tree<String>> children) {
 214         String ret = "";
 215         for(Tree<String> t : children) ret += string(t);
 216         return ret;
 217     }
 218 }