checkpoint
[sbp.git] / src / edu / berkeley / sbp / meta / MetaGrammar.java
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.*;
7 import java.util.*;
8 import java.lang.annotation.*;
9 import java.lang.reflect.*;
10 import java.io.*;
11
12 public class MetaGrammar {
13     
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");
17             System.exit(-1);
18         }
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";
22
23         BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(fileName)));
24         StringBuffer out = new StringBuffer();
25
26         boolean skip = false;
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");
31         }
32
33         out.append("\n        // DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED\n");
34
35         Tree t = MetaGrammarTree.meta;
36         Union u = MetaGrammar.make(t, "s");
37
38         System.err.println();
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());
42
43         t.toJava(out);
44         out.append("\n        // DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED\n");
45
46         for(String s = br.readLine(); s != null; s = br.readLine()) out.append(s+"\n");
47         br.close();
48
49         OutputStream os = new FileOutputStream(fileName);
50         PrintWriter p = new PrintWriter(new OutputStreamWriter(os));
51         p.println(out.toString());
52         p.flush();
53         os.close();
54     }
55    
56     public static class TreeBindable {
57
58         private Bindable _bindable;
59         public TreeBindable(Object o) { this(Bindable.create(o)); }
60         public TreeBindable(Bindable b) { this._bindable = b; }
61
62         private int[] buildSequence(Production p) {
63             return p.buildSequence(_bindable);
64         }
65
66         public String  getName()   { return _bindable.getSimpleName(); }
67         public bind    getBind()   { return (bind)_bindable.getAnnotation(bind.class); }
68         public bind.as getBindAs() { return (bind.as)_bindable.getAnnotation(bind.as.class); }
69         public String  toString()  { return _bindable.getSimpleName(); }
70         public boolean isRaw()     { return _bindable.isAnnotationPresent(bind.raw.class); }
71
72         public boolean isCompatible(Production p) {
73             bind.as t = getBindAs();
74             bind b = getBind();
75
76             if (t != null &&
77                 (t.value().equals(p.tag)))
78                 return buildSequence(p)!=null;
79
80             if (t != null &&
81                 ((t.value().equals("") && getName().equals(p.tag))))
82                 return buildSequence(p)!=null;
83             if (b != null && getName().equals(p.tag))
84                 return buildSequence(p)!=null;
85
86             if (t != null &&
87                 (t.value().equals(p.tag)))
88                 return buildSequence(p)!=null;
89             if (t != null &&
90                 ((t.value().equals("") && getName().equals(p.tag))))
91                 return buildSequence(p)!=null;
92             if (b != null && getName().equals(p.tag))
93                 return buildSequence(p)!=null;
94
95             return false;
96         }
97
98         public Sequence makeSequence(final Production p) {
99
100             if (_bindable.getArgTypes().length > 0 &&
101                 _bindable.getArgTypes()[0] == Input.Region.class) {
102                 Functor<Input.Region,Object> func = new Functor<Input.Region,Object>() {
103                     public Object invoke(final Input.Region region) {
104                         return 
105                         new TreeBindableReducer(buildSequence(p),
106                                                 _bindable,
107                                                 isRaw()) {
108                             public Object invoke(Iterable<Tree<Object>> t) {
109                                 if (_israw) return _bindable.impose(new Object[] { t });
110                                 ArrayList ret = new ArrayList();
111                                 ret.add(region);
112                                 for(Tree tc : t) {
113                                     if (tc.head() != null && tc.head() instanceof Functor)
114                                         ret.add(((Tree.TreeFunctor<Object,Object>)tc.head()).invoke(tc.children()));
115                                     else if (tc.numChildren() == 0)
116                                         ret.add(tc.head());
117                                     else {
118                                         System.err.println("FIXME: don't know what to do about " + tc);
119                                         ret.add(null);
120                                     }
121                                 }
122                                 Object[] o = (Object[])ret.toArray(new Object[0]);
123                                 int max = 0;
124                                 for(int i=0; i<map.length; i++) max = Math.max(map[i], max);
125                                 Object[] o2 = new Object[max+2];
126                                 for(int i=0; i<o.length; i++) o2[map[i]+1] = o[i];
127                                 o2[0] = region;
128                                 return _bindable.impose(o2);
129                             }
130                         };
131                     }
132                 };
133                 return Sequence.regionRewritingSequence(func,
134                                                         p.elements,
135                                                         p.drops);
136             }
137
138             if (isRaw())
139                 return Sequence.rewritingSequence(new Tree.BindingFunctor(_bindable.createBinding()),
140                                                   p.elements,
141                                                   p.drops);
142             return Sequence.rewritingSequence(new TreeBindableReducer(buildSequence(p),
143                                                                       _bindable,
144                                                                       isRaw()),
145                                               p.elements,
146                                               p.drops);
147         }
148
149     }
150
151     public static class TreeBindableReducer implements Tree.TreeFunctor<Object,Object>, ToJava {
152          int[] map;
153          Bindable _bindable;
154          boolean _israw;
155
156         public void toJava(StringBuffer sb) {
157             sb.append("new MetaGrammar.TreeBindableReducer(new int[] {");
158             for(int i=0; i<map.length; i++) sb.append((i+"")+(i<map.length-1 ? "," : ""));
159             sb.append("}, ");
160             _bindable.toJava(sb);
161             sb.append(", ");
162             sb.append(_israw ? "true" : "false");
163             sb.append(")");
164         }
165         
166         public TreeBindableReducer(int[] map, Bindable b, boolean raw) {
167             this.map = map;
168             this._bindable = b;
169             this._israw = raw;
170         }
171         public String toString() { return "reducer-"+_bindable.toString(); }
172         public Object invoke(Iterable<Tree<Object>> t) {
173             if (_israw) return _bindable.createBinding().invoke(new Object[] { t });
174             ArrayList ret = new ArrayList();
175             for(Tree tc : t) {
176                 if (tc.head() != null && tc.head() instanceof Functor)
177                     ret.add(((Tree.TreeFunctor<Object,Object>)tc.head()).invoke(tc.children()));
178                 else if (tc.numChildren() == 0)
179                     ret.add(tc.head());
180                 else {
181                     System.err.println("FIXME: don't know what to do about " + tc);
182                     ret.add(null);
183                 }
184             }
185             Object[] o = (Object[])ret.toArray(new Object[0]);
186             return _bindable.createBinding(map).invoke(o);
187         }
188     }
189
190
191     public static Union make() { return make(MetaGrammarTree.meta, "s"); }
192     public static Union make(Tree t, String s) { return make(t, s, new AnnotationGrammarBindingResolver(MetaGrammarBindings.class)); }
193     public static Union make(Tree t, String s, GrammarBindingResolver rm) {
194         Tree.TreeFunctor<Object,Object> red = (Tree.TreeFunctor<Object,Object>)t.head();
195         MetaGrammarBindings.GrammarNode g = (MetaGrammarBindings.GrammarNode)red.invoke(t.children());
196         return g.build(s, rm);
197     }
198
199 }