1 package edu.berkeley.sbp.meta;
2 import edu.berkeley.sbp.util.*;
3 import edu.berkeley.sbp.*;
4 import edu.berkeley.sbp.chr.*;
5 import edu.berkeley.sbp.misc.*;
6 import edu.berkeley.sbp.bind.*;
8 import java.lang.annotation.*;
9 import java.lang.reflect.*;
12 public class MetaGrammar {
14 public static void main(String[] args) throws Exception {
15 if (args.length != 2) {
16 System.err.println("usage: java " + MetaGrammar.class.getName() + " grammarfile.g com.yourdomain.package.ClassName");
19 String className = args[1].substring(args[1].lastIndexOf('.')+1);
20 String packageName = args[1].substring(0, args[1].lastIndexOf('.'));
21 String fileName = packageName.replace('.', '/') + "/" + className + ".java";
23 BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(fileName)));
24 StringBuffer out = new StringBuffer();
27 for(String s = br.readLine(); s != null; s = br.readLine()) {
28 if (s.indexOf("DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED") != -1 && s.indexOf("\"")==-1) skip = true;
29 if (s.indexOf("DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED") != -1 && s.indexOf("\"")==-1) break;
30 if (!skip) out.append(s+"\n");
33 out.append("\n // DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED\n");
35 Tree t = MetaGrammarTree.meta;
36 Union u = MetaGrammar.make(t, "s");
39 System.err.println("== parsing with parsed grammar =================================================================================");
40 t = new CharParser((Union)u).parse(new FileInputStream(args[0])).expand1();
41 System.out.println(t.toPrettyString());
44 out.append("\n // DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED\n");
46 for(String s = br.readLine(); s != null; s = br.readLine()) out.append(s+"\n");
49 OutputStream os = new FileOutputStream(fileName);
50 PrintWriter p = new PrintWriter(new OutputStreamWriter(os));
51 p.println(out.toString());
58 public static class Production {
60 public String nonTerminal;
61 public Object[] labels;
62 public boolean[] drops;
63 public Element[] elements;
65 public Production(String tag, String nonTerminal, Element[] elements, Object[] labels, boolean[] drops) {
67 this.elements = elements;
68 this.nonTerminal = nonTerminal;
71 for(int i=0; i<drops.length; i++)
77 public static class Target {
78 public int[] buildSequence(Production p) {
79 Annotation[][] annotations = _bindable.getArgAnnotations();
80 String[] names = _bindable.getArgNames();
81 String name = _bindable.getSimpleName();
82 int len = annotations.length;
84 bind.arg[] argtags = new bind.arg[len];
85 for(int i=0; i<names.length; i++)
86 for(Annotation a : annotations[i+ofs])
87 if (a instanceof bind.arg)
88 argtags[i+ofs] = (bind.arg)a;
89 return Target.this.buildSequence(p, names, argtags);
91 private Bindable _bindable;
93 public Target(Object o) { this(Bindable.create(o)); }
94 public Target(Bindable b) { this._bindable = b; }
96 public String getName() { return _bindable.getSimpleName(); }
97 public bind getBind() { return (bind)_bindable.getAnnotation(bind.class); }
98 public bind.as getBindAs() { return (bind.as)_bindable.getAnnotation(bind.as.class); }
99 public String toString() { return _bindable.getSimpleName(); }
100 public boolean isRaw() { return _bindable.isAnnotationPresent(bind.raw.class); }
102 public boolean isCompatible(Production p) {
103 bind.as t = getBindAs();
107 (t.value().equals(p.tag)))
108 return buildSequence(p)!=null;
111 ((t.value().equals("") && getName().equals(p.tag))))
112 return buildSequence(p)!=null;
113 if (b != null && getName().equals(p.tag))
114 return buildSequence(p)!=null;
117 (t.value().equals(p.nonTerminal)))
118 return buildSequence(p)!=null;
120 ((t.value().equals("") && getName().equals(p.nonTerminal))))
121 return buildSequence(p)!=null;
122 if (b != null && getName().equals(p.nonTerminal))
123 return buildSequence(p)!=null;
128 public int[] buildSequence(Production p, String[] names, bind.arg[] argtags) {
130 for(int i=0; i<argtags.length; i++)
131 if (argtags[i] != null)
134 // FIXME: can be smarter here
135 if (argTagged==p.count) {
136 int[] ret = new int[argtags.length];
138 for(int i=0; i<argtags.length; i++) {
139 if (argtags[i]==null) continue;
140 if (argtags[i].value().equals(""))
144 for(int k=0; k<names.length; k++)
145 if (argtags[i].value().equals(names[k])){
149 if (ret[i]==-1) return null;
153 } else if (names.length==p.count) {
154 int[] ret = new int[p.count];
155 for(int i=0; i<p.count; i++) ret[i] = i;
161 public Sequence makeSequence(Production p) {
162 return Sequence.rewritingSequence(new TargetReducer(buildSequence(p), _bindable, isRaw()),
163 p.elements, p.labels, p.drops);
168 public static class TargetReducer implements Tree.TreeFunctor<Object,Object>, ToJava {
170 private Bindable _bindable;
171 private boolean _israw;
173 public void toJava(StringBuffer sb) {
174 sb.append("new MetaGrammar.TargetReducer(new int[] {");
175 for(int i=0; i<map.length; i++)
176 sb.append((i+"")+(i<map.length-1 ? "," : ""));
178 _bindable.toJava(sb);
180 sb.append(_israw ? "true" : "false");
184 public TargetReducer(int[] map, Bindable b, boolean raw) {
189 public String toString() { return "reducer-"+_bindable.toString(); }
190 public Object invoke(Iterable<Tree<Object>> t) {
191 if (_israw) return _bindable.impose(new Object[] { t });
192 ArrayList ret = new ArrayList();
194 if (tc.head() != null && tc.head() instanceof Functor)
195 ret.add(((Tree.TreeFunctor<Object,Object>)tc.head()).invoke(tc.children()));
196 else if (tc.numChildren() == 0)
199 System.err.println("FIXME: don't know what to do about " + tc);
203 //System.err.println("input tree: " + t);
204 Object[] o = (Object[])ret.toArray(new Object[0]);
206 for(int i=0; i<map.length; i++) max = Math.max(map[i], max);
207 Object[] o2 = new Object[max+1];
208 for(int i=0; i<o.length; i++) o2[map[i]] = o[i];
209 return _bindable.impose(o2);
214 public static Union cached = null;
215 public static Union make() { return make(MetaGrammarTree.meta, "s"); }
216 public static Union make(Tree t, String s) { return make(t, s, new AnnotationGrammarBindingResolver(MetaGrammarBindings.class)); }
217 public static Union make(Tree t, String s, GrammarBindingResolver rm) {
218 Tree.TreeFunctor<Object,Object> red = (Tree.TreeFunctor<Object,Object>)t.head();
219 MetaGrammarBindings.GrammarNode g = (MetaGrammarBindings.GrammarNode)red.invoke(t.children());
220 Context cx = new Context(g,rm);
222 for(MetaGrammarBindings.NonTerminalNode nt : g.values()) {
223 Union el = (Union)cx.get(nt.name);
224 StringBuffer st = new StringBuffer();
226 if (nt.name.equals(s)) u = el;
233 public static class Context {
234 public HashMap<String,Union> map = new HashMap<String,Union>();
235 public MetaGrammarBindings.GrammarNode grammar;
236 public String cnt = null;
237 public GrammarBindingResolver rm;
238 public Context(MetaGrammarBindings.GrammarNode g, GrammarBindingResolver rm) {
242 public Union build() {
244 for(MetaGrammarBindings.NonTerminalNode nt : grammar.values()) {
245 Union u = get(nt.name);
246 if ("s".equals(nt.name))
251 public Context(Tree t, GrammarBindingResolver rm) {
253 Tree.TreeFunctor<Object,Object> red = (Tree.TreeFunctor<Object,Object>)t.head();
254 this.grammar = (MetaGrammarBindings.GrammarNode)red.invoke(t.children());
256 public Union peek(String name) { return map.get(name); }
257 public void put(String name, Union u) { map.put(name, u); }
258 public Union get(String name) {
259 Union ret = map.get(name);
260 if (ret != null) return ret;
261 ret = new Union(name);
263 MetaGrammarBindings.NonTerminalNode nt = grammar.get(name);
265 System.err.println("*** warning could not find " + name);
276 /*private*/ static Atom infer(Element e) { return infer((Topology<Character>)Atom.toAtom(e)); }
277 /*private*/ static Atom infer(Topology<Character> t) { return new CharRange(new CharTopology(t)); }