1 package edu.berkeley.sbp.misc;
2 import edu.berkeley.sbp.util.*;
3 import edu.berkeley.sbp.*;
4 import edu.berkeley.sbp.chr.*;
5 import edu.berkeley.sbp.bind.*;
7 import java.lang.annotation.*;
8 import java.lang.reflect.*;
11 public class MetaGrammar {
13 public static boolean harsh = true;
15 public static void main(String[] args) throws Exception {
16 if (args.length != 2) {
17 System.err.println("usage: java " + MetaGrammar.class.getName() + " grammarfile.g com.yourdomain.package.ClassName");
20 //StringBuffer sbs = new StringBuffer();
21 //((MetaGrammar)new MetaGrammar().walk(meta)).nt.get("e").toString(sbs);
22 //System.err.println(sbs);
23 String className = args[1].substring(args[1].lastIndexOf('.')+1);
24 String packageName = args[1].substring(0, args[1].lastIndexOf('.'));
25 String fileName = packageName.replace('.', '/') + "/" + className + ".java";
27 BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(fileName)));
28 StringBuffer out = new StringBuffer();
31 for(String s = br.readLine(); s != null; s = br.readLine()) {
32 if (s.indexOf("DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED") != -1 && s.indexOf("\"")==-1) skip = true;
33 if (s.indexOf("DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED") != -1 && s.indexOf("\"")==-1) break;
34 if (!skip) out.append(s+"\n");
37 out.append("\n // DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED\n");
40 ReflectiveMeta m = new ReflectiveMeta();
41 Tree<String> res = new CharParser(MetaGrammar.make()).parse(new FileInputStream(args[0])).expand1();
42 MetaGrammar.Meta.MetaGrammarFile mgf = m.new MetaGrammarFile(res);
43 MetaGrammar.BuildContext bc = new MetaGrammar.BuildContext(mgf);
45 Union meta = mgf.get("s").build(bc);
46 Tree t = new CharParser(meta).parse(new FileInputStream(args[0])).expand1();
48 Tree t = MetaGrammarTree.meta;
49 Union u = MetaGrammar.make(t, "s");
52 System.err.println("== parsing with parsed grammar =================================================================================");
53 t = new CharParser((Union)u).parse(new FileInputStream(args[0])).expand1();
54 System.out.println(t.toPrettyString());
55 //Forest<String> fs = new CharParser(make()).parse(new FileInputStream(args[0]));
56 //System.out.println(fs.expand1());
58 //GraphViz gv = new GraphViz();
60 //FileOutputStream fox = new FileOutputStream("out.dot");
65 out.append("\n // DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED\n");
67 for(String s = br.readLine(); s != null; s = br.readLine()) out.append(s+"\n");
70 OutputStream os = new FileOutputStream(fileName);
71 PrintWriter p = new PrintWriter(new OutputStreamWriter(os));
72 p.println(out.toString());
77 public static class ReflectiveMetaPlain extends ReflectiveMeta {
78 public Object repeatTag() { return null; }
79 public Sequence tryResolveTag(String tag, String nonTerminalName, Element[] els, Object[] labels, boolean[] drops) {
81 public Sequence resolveTag(String tag, String nonTerminalName, Element[] els, Object[] labels, boolean[] drops) {
82 return Sequence.rewritingSequence(tag, els, labels, drops);
86 public static class ReflectiveMeta /*extends MetaGrammar.Meta*/ {
87 private final Class _cl;
88 private final Class[] _inner;
89 public ReflectiveMeta() {
92 public ReflectiveMeta(Class c) {
94 this._inner = c.getDeclaredClasses();
96 public ReflectiveMeta(Class c, Class[] inner) {
100 private boolean match(Method m, String s) { return match(m.getAnnotation(bind.as.class), null, s); }
101 private boolean match(bind.as t, Class c, String s) {
102 if (t==null) return false;
103 if (t.value().equals(s)) return true;
104 if (c != null && t.equals("") && c.getSimpleName().equals(s)) return true;
108 private boolean match(nonterminal t, Class c, String s) {
109 if (t==null) return false;
110 if (t.value().equals(s)) return true;
111 if (c != null && t.equals("") && c.getSimpleName().equals(s)) return true;
115 private boolean match(Class c, String s, String nonTerminalName) {
116 if (match((bind.as)c.getAnnotation(bind.as.class), c, s)) return true;
117 //if (match((nonterminal)c.getAnnotation(bind.as.class), c, nonTerminalName)) return true;
120 public boolean match(Constructor con, String s, String nonTerminalName) {
121 Class c = con.getDeclaringClass();
122 if (match((bind.as)con.getAnnotation(bind.as.class), null, s)) return true;
123 //if (match((nonterminal)con.getAnnotation(bind.as.class), c, s)) return true;
126 public Object repeatTag() {
127 return new Tree.ArrayBuildingTreeFunctor<Object>();
129 public Sequence tryResolveTag(String tag, String nonTerminalName, Element[] els, Object[] labels, boolean[] drops) {
130 Production p = new Production(tag, nonTerminalName, els, labels, drops);
131 for(Method m : _cl.getMethods())
132 if (new Target(m).isCompatible(p))
133 return new Target(m).makeSequence(p);
134 for(Class c : _inner)
135 for(Constructor con : c.getConstructors())
136 if (new Target(con).isCompatible(p))
137 return new Target(con).makeSequence(p);
138 for(Class c : _inner)
139 if (new Target(c).isCompatible(p))
140 return new Target(c).makeSequence(p);
143 public Sequence resolveTag(String tag, String nonTerminalName, Element[] els, Object[] labels, boolean[] drops) {
144 Sequence ret = tryResolveTag(tag, nonTerminalName, els, labels, drops);
145 if (ret != null) return ret;
146 String message = "could not find a Java method/class/ctor matching tag \""+tag+
147 "\", nonterminal \""+nonTerminalName+"\" with " + els.length + " arguments";
149 throw new RuntimeException(message);
151 System.err.println(message);
152 return Sequence.rewritingSequence(tag, els, labels, drops);
158 public static class Production {
160 public String nonTerminal;
161 public Object[] labels;
162 public boolean[] drops;
163 public Element[] elements;
164 public int count = 0;
165 public Production(String tag, String nonTerminal, Element[] elements, Object[] labels, boolean[] drops) {
167 this.elements = elements;
168 this.nonTerminal = nonTerminal;
169 this.labels = labels;
171 for(int i=0; i<drops.length; i++)
177 public static class Target {
178 public int[] buildSequence(Production p) {
179 Annotation[][] annotations = _bindable.getArgAnnotations();
180 String[] names = _bindable.getArgNames();
181 String name = _bindable.getSimpleName();
182 int len = annotations.length;
184 bind.arg[] argtags = new bind.arg[len];
185 for(int i=0; i<names.length; i++)
186 for(Annotation a : annotations[i+ofs])
187 if (a instanceof bind.arg)
188 argtags[i+ofs] = (bind.arg)a;
189 return Target.this.buildSequence(p, names, argtags);
191 private Bindable _bindable;
193 public Target(Object o) { this(Bindable.create(o)); }
194 public Target(Bindable b) { this._bindable = b; }
196 public String getName() { return _bindable.getSimpleName(); }
197 public bind.as getBindAs() { return (bind.as)_bindable.getAnnotation(bind.as.class); }
198 //public nonterminal getNonTerminal() { return (nonterminal)_bindable.getAnnotation(bind.as.class); }
199 public String toString() { return _bindable.getSimpleName(); }
200 public boolean isRaw() { return _bindable.isAnnotationPresent(bind.raw.class); }
202 public boolean isCompatible(Production p) {
203 bind.as t = getBindAs();
205 (t.value().equals(p.tag) ||
206 (t.value().equals("") && getName().equals(p.tag))))
207 return buildSequence(p)!=null;
209 bind.as n = getBindAs();
211 (n.value().equals(p.nonTerminal) ||
212 (n.value().equals("") && getName().equals(p.nonTerminal))))
213 return buildSequence(p)!=null;
218 public int[] buildSequence(Production p, String[] names, bind.arg[] argtags) {
220 for(int i=0; i<argtags.length; i++)
221 if (argtags[i] != null)
224 // FIXME: can be smarter here
225 if (names.length==p.count) {
226 int[] ret = new int[p.count];
227 for(int i=0; i<p.count; i++) ret[i] = i;
229 } else if (argTagged==p.count) {
230 int[] ret = new int[argtags.length];
232 for(int i=0; i<argtags.length; i++)
233 ret[i] = argtags[i]==null ? -1 : (j++);
239 public Sequence makeSequence(Production p) {
240 return Sequence.rewritingSequence(new TargetReducer(buildSequence(p), _bindable, isRaw()),
241 p.elements, p.labels, p.drops);
246 public static class TargetReducer implements Tree.TreeFunctor<Object,Object>, ToJava {
248 private Bindable _bindable;
249 private boolean _israw;
251 public void toJava(StringBuffer sb) {
252 sb.append("new MetaGrammar.TargetReducer(new int[] {");
253 for(int i=0; i<map.length; i++)
254 sb.append((i+"")+(i<map.length-1 ? "," : ""));
256 _bindable.toJava(sb);
258 sb.append(_israw ? "true" : "false");
262 public TargetReducer(int[] map, Bindable b, boolean raw) {
267 public String toString() { return "reducer-"+_bindable.toString(); }
268 public Object invoke(Iterable<Tree<Object>> t) {
269 if (_israw) return _bindable.impose(new Object[] { t });
270 ArrayList ret = new ArrayList();
272 if (tc.head() != null && tc.head() instanceof Functor)
273 ret.add(((Tree.TreeFunctor<Object,Object>)tc.head()).invoke(tc.children()));
274 else if (tc.numChildren() == 0)
277 System.err.println("FIXME: don't know what to do about " + tc);
281 System.err.println("input tree: " + t);
282 Object[] o = (Object[])ret.toArray(new Object[0]);
284 for(int i=0; i<map.length; i++) max = Math.max(map[i], max);
285 Object[] o2 = new Object[max+1];
286 for(int i=0; i<o.length; i++) o2[map[i]] = o[i];
287 return _bindable.impose(o2);
292 public static Union cached = null;
293 public static Union make() {
295 if (cached != null) return cached;
297 ReflectiveMeta m = new ReflectiveMeta();
298 Tree<String> res = new CharParser(MetaGrammar.make()).parse(new FileInputStream("tests/meta.g")).expand1();
299 MetaGrammar.Meta.MetaGrammarFile mgf = m.new MetaGrammarFile(res);
300 MetaGrammar.BuildContext bc = new MetaGrammar.BuildContext(mgf);
301 Union meta = mgf.get("s").build(bc);
302 Tree t = new CharParser(meta).parse(new FileInputStream("tests/meta.g")).expand1();
303 return cached = make(t, "s");
304 } catch (Exception e) {
305 throw new RuntimeException(e);
308 return make(MetaGrammarTree.meta, "s");
310 public static Union make(Tree t, String s) { return make(t, s, new ReflectiveMeta()); }
311 public static Union make(Tree t, String s, ReflectiveMeta rm) {
312 System.out.println("Head: " + t.head());
313 Tree.TreeFunctor<Object,Object> red = (Tree.TreeFunctor<Object,Object>)t.head();
314 MG.Grammar g = (MG.Grammar)red.invoke(t.children());
315 Context cx = new Context(g,rm);
317 for(MG.NonTerminal nt : g.nonterminals) {
318 System.out.println(nt.name);
319 Union el = (Union)cx.get(nt.name);
320 StringBuffer st = new StringBuffer();
322 System.err.println(st);
323 if (nt.name.equals(s)) u = el;
330 public static class MG {
331 public static @bind.as Object grammar(Object[] o) {
332 if (o==null) return null;
333 if (o[0] != null && o[0] instanceof Grammar) return o[0];
334 Grammar g = new Grammar();
335 g.nonterminals = (NonTerminal[])Reflection.lub((Object[])o);
338 public static @bind.as class Grammar {
339 public NonTerminal get(String s) {
340 for(NonTerminal nt : nonterminals)
341 if (nt.name.equals(s))
345 public @bind.arg NonTerminal[] nonterminals;
346 public String toString() {
348 for(NonTerminal nt : nonterminals) ret += nt + ", ";
352 public abstract static class Un extends El {
353 public Seq[][] sequences;
354 public void build(Context cx, Union u) {
355 HashSet<Sequence> bad2 = new HashSet<Sequence>();
356 for(int i=0; i<sequences.length; i++) {
357 Seq[] group = sequences[i];
358 Union u2 = new Union();
359 if (sequences.length==1) u2 = u;
360 for(int j=0; j<group.length; j++) {
361 group[j].build(cx, u2, false);
363 if (sequences.length==1) break;
364 Sequence seq = Sequence.singleton(u2);
365 for(Sequence s : bad2) {
370 bad2.add(Sequence.singleton(u2));
374 public static class NonTerminal extends Un {
375 public String name = null;
376 public @bind.as("NonTerminal") NonTerminal(@bind.arg("Word") String name,
377 @bind.arg("RHS") Seq[][] sequences) {
379 this.sequences = sequences;
381 public Element build(Context cx) { return cx.get(name); }
384 public static class AnonUn extends Un {
385 public @bind.as("(") AnonUn(Seq[][] sequences) {
386 this.sequences = sequences;
388 public Element build(Context cx) {
389 Union ret = new Union();
395 //public static @bind.as void range(char c) { }
396 public static class Range {
397 public @bind.as("range") Range(char only) { first = only; last = only; }
398 public @bind.as("-") Range(char first, char last) { this.first = first; this.last = last; }
402 public static abstract class El {
403 public String getLabel() { return null; }
404 public String getOwnerTag() { return null; }
405 public boolean drop() { return false; }
406 public abstract Element build(Context cx);
408 public static class Drop extends El {
410 public Drop(El e) { this.e = e; }
411 public String getLabel() { return null; }
412 public boolean drop() { return true; }
413 public String getOwnerTag() { return e.getOwnerTag(); }
414 public Element build(Context cx) { return e.build(cx); }
416 public static class Label extends El {
419 public Label(String label, El e) { this.e = e; this.label = label; }
420 public String getLabel() { return label; }
421 public String getOwnerTag() { return e.getOwnerTag(); }
422 public Element build(Context cx) { return e.build(cx); }
424 public static /*abstract*/ class Seq {
425 HashSet<Seq> and = new HashSet<Seq>();
426 HashSet<Seq> not = new HashSet<Seq>();
431 public Seq(El e) { this(new El[] { e }); }
432 public Seq(El[] elements) { this.elements = elements; }
433 public Seq tag(String tag) { this.tag = tag; return this; }
434 public Seq follow(El follow) { this.follow = follow; return this; }
436 Seq ret = new Seq(elements);
443 public Seq and(Seq s) { and.add(s); s.lame = true; return this; }
444 public Seq andnot(Seq s) { not.add(s); s.lame = true; return this; }
445 public Seq separate(El sep) {
446 El[] elements = new El[this.elements.length * 2 - 1];
447 for(int i=0; i<this.elements.length; i++) {
448 elements[i*2] = this.elements[i];
449 if (i<this.elements.length-1)
450 elements[i*2+1] = new Drop(sep);
452 this.elements = elements;
455 public Sequence build(Context cx, Union u, boolean lame) {
456 Sequence ret = build0(cx, lame || this.lame);
457 for(Seq s : and) { Sequence dork = s.build(cx, u, true); ret = ret.and(dork); }
458 for(Seq s : not) { Sequence dork = s.build(cx, u, true); ret = ret.not(dork); }
463 public Sequence build0(Context cx, boolean lame) {
464 boolean unwrap = false;
465 boolean dropAll = lame;
466 if (tag!=null && tag.equals("[]")) unwrap = true;
467 if (tag!=null && "()".equals(tag)) dropAll = true;
468 Object[] labels = new Object[elements.length];
469 boolean[] drops = new boolean[elements.length];
470 Element[] els = new Element[elements.length];
471 for(int i=0; i<elements.length; i++) {
472 labels[i] = elements[i].getLabel();
473 drops[i] = elements[i].drop();
474 els[i] = elements[i].build(cx);
475 if (elements[i].getOwnerTag() != null)
476 tag = elements[i].getOwnerTag();
479 if (dropAll) ret = Sequence.drop(els, false);
480 else if (unwrap) ret = Sequence.unwrap(els, cx.rm.repeatTag(), drops);
481 else if (tag!=null) {
482 ret = cx.rm.resolveTag(tag, cx.cnt, els, labels, drops);
484 ret = cx.rm.tryResolveTag(tag, cx.cnt, els, labels, drops);
487 for(int i=0; i<els.length; i++)
489 if (idx==-1) idx = i;
490 else throw new Error("multiple non-dropped elements in sequence: " + Sequence.drop(els,false));
491 if (idx != -1) ret = Sequence.singleton(els, idx);
492 else ret = Sequence.drop(els, false);
495 if (this.follow != null)
496 ret.follow = infer(this.follow.build(cx));
497 ret.lame = this.lame;
501 public static @bind.as("&") Seq and(Seq s, El[] elements) { return s.and(seq(elements)); }
502 public static @bind.as("&~") Seq andnot(Seq s, El[] elements) { return s.andnot(seq(elements)); }
503 public static @bind.as("->") Seq arrow(Seq s, El e) { return s.follow(e); }
504 public static @bind.as("::") Seq tag(String tagname, Seq s) { return s.tag(tagname); }
505 public static @bind.as("/") Seq slash(Seq s, El e) { return s.separate(e); }
507 public static @bind.as("ps") Seq seq(El[] elements) { return new Seq(elements); }
508 public static @bind.as Seq psx(Seq s) { return s; }
509 public static @bind.as(":") El colon(String s, El e) { return new Label(s, e); }
510 public static @bind.as(")") void close(String foo) { throw new Error("not supported"); }
511 public static @bind.as("()") El epsilon() { return new Constant(Union.epsilon); }
513 public static @bind.as("nonTerminal") class NonTerminalReference extends El {
514 public @bind.arg String nonTerminal;
515 public Element build(Context cx) {
516 return cx.get(nonTerminal);
520 public static class StringLiteral extends Constant {
521 public @bind.as("literal") StringLiteral(String string) { super(CharRange.string(string)); }
522 public boolean drop() { return true; }
525 public static class CharClass extends El {
527 public @bind.as("[") CharClass(Range[] ranges) { this.ranges = ranges; }
528 public Element build(Context cx) {
529 edu.berkeley.sbp.util.Range.Set set = new edu.berkeley.sbp.util.Range.Set();
530 for(Range r : ranges)
531 set.add(r.first, r.last);
532 return CharRange.set(set);
536 public static @bind.as("{") class XTree extends El {
537 public @bind.arg Seq body;
538 public Element build(Context cx) {
543 public static class Rep extends El {
545 public boolean zero, many, max;
546 public Rep(El e, El sep, boolean zero, boolean many, boolean max) {
547 this.e = e; this.sep = sep; this.zero = zero; this.many = many; this.max = max;}
548 public Element build(Context cx) {
550 ? Sequence.repeat(e.build(cx), zero, many, sep==null ? null : sep.build(cx), cx.rm.repeatTag())
552 ? Sequence.repeatMaximal(infer(e.build(cx)), zero, many, cx.rm.repeatTag())
553 : Sequence.repeatMaximal(e.build(cx), zero, many, infer(sep.build(cx)), cx.rm.repeatTag());
556 public static class Constant extends El {
558 public Constant(Element constant) { this.constant = constant; }
559 public Element build(Context cx) { return constant; }
561 public abstract static class PostProcess extends El {
563 public PostProcess(El e) { this.e = e; }
564 public Element build(Context cx) { return postProcess(e.build(cx)); }
565 public abstract Element postProcess(Element e);
568 // FIXME: it would be nice if we could hoist this into "Rep"
569 public static @bind.as("++") El plusmax(final El e) { return new Rep(e, null, false, true, true); }
570 public static @bind.as("+") El plus(final El e) { return new Rep(e, null, false, true, false); }
571 public static @bind.as("++/") El plusmaxfollow(final El e, final El sep) { return new Rep(e, sep, false, true, true); }
572 public static @bind.as("+/") El plusfollow(final El e, final El sep) { return new Rep(e, sep, false, true, false); }
573 public static @bind.as("**") El starmax(final El e) { return new Rep(e, null, true, true, true); }
574 public static @bind.as("*") El star(final El e) { return new Rep(e, null, true, true, false); }
575 public static @bind.as("**/") El starmaxfollow(final El e, final El sep) { return new Rep(e, sep, true, true, true); }
576 public static @bind.as("*/") El starfollow(final El e, final El sep) { return new Rep(e, sep, true, true, false); }
577 public static @bind.as("?") El question(final El e) { return new Rep(e, null, true, true, false); }
579 public static @bind.as("!") El bang(final El e) { return new Drop(e); }
581 public static @bind.as("^") El caret(final String s) {
582 return new Drop(new Constant(CharRange.string(s)) {
583 public String getOwnerTag() { return s; }
587 public static @bind.as("~") El tilde(final El e) {
588 return new PostProcess(e) {
589 public Element postProcess(Element e) {
590 return infer((Topology<Character>)Atom.toAtom(e).complement());
593 public static @bind.as("^^") void doublecaret(final El e) { throw new Error("not implemented"); }
595 //public static @bind.as("(") El subexpression(Seq[][] rhs) { return new NonTerminal(rhs); }
597 public static @bind.as("Word") String word(String s) { return s; }
598 public static @bind.as("Quoted") String quoted(String s) { return s; }
599 public static @bind.as("escaped") String c(char c) { return c+""; }
600 public static @bind.as("\"\"") String emptystring() { return ""; }
601 public static @bind.as("\n") String retur() { return "\n"; }
602 public static @bind.as("\r") String lf() { return "\r"; }
605 public static class Context {
606 HashMap<String,Union> map = new HashMap<String,Union>();
607 private MG.Grammar grammar;
608 public String cnt = null;
609 private ReflectiveMeta rm;
610 public Context(MG.Grammar g, ReflectiveMeta rm) {
614 public Union build() {
616 for(MG.NonTerminal nt : grammar.nonterminals) {
617 Union u = get(nt.name);
618 if ("s".equals(nt.name))
623 public Context(Tree t, ReflectiveMeta rm) {
625 Tree.TreeFunctor<Object,Object> red = (Tree.TreeFunctor<Object,Object>)t.head();
626 this.grammar = (MG.Grammar)red.invoke(t.children());
628 public Union peek(String name) { return map.get(name); }
629 public void put(String name, Union u) { map.put(name, u); }
630 public Union get(String name) {
631 Union ret = map.get(name);
632 if (ret != null) return ret;
633 ret = new Union(name);
635 MG.NonTerminal nt = grammar.get(name);
637 System.err.println("*** warning could not find " + name);
648 /*private*/ static Atom infer(Element e) { return infer((Topology<Character>)Atom.toAtom(e)); }
649 /*private*/ static Atom infer(Topology<Character> t) { return new CharRange(new CharTopology(t)); }