1 package edu.berkeley.sbp.misc;
2 import edu.berkeley.sbp.util.*;
3 import edu.berkeley.sbp.*;
7 public class MetaGrammar extends ReflectiveWalker {
9 public static Union make() throws Exception {
10 return ((MetaGrammar)new MetaGrammar().walk(meta)).done();
15 private static HashSet<Union> dropAll = new HashSet<Union>();
17 // Statics //////////////////////////////////////////////////////////////////////////////
19 private static final Union SELF = new Union("()");
21 public static Union epsilon = new Union("()");
22 static { epsilon.add(Sequence.empty); }
24 // MetaGrammar //////////////////////////////////////////////////////////////////////////////
26 public Object walk(String tag, Object[] argo) {
27 if ("dork".equals(tag)) return Reflection.lub(argo);
28 return super.walk(tag, argo);
30 public PreSequence[] dork(PreSequence[] p) { return p; }
31 public Object _star_(Element r) { return new Rep(r, null, false, true); }
32 public Element _leftbracket_(Object o, Object[] args) { return rangex(o==null || !(o instanceof Character) ? null : o, args); }
33 public Union _colon__colon__equals_(String s, PreSequence[][] p) { return nonTerminalZ(s, p); }
34 public Union _bang__colon__colon__equals_(String s, PreSequence[][] p) {
35 return nonTerminalZ(s, p, true); }
36 public Union _colon__colon__equals_(boolean q, String s, PreSequence[][] p) {
37 return nonTerminalZ(s, p, q);
39 public Element _leftparen__rightparen_() { return epsilon; }
40 public Element epsilon(Object o, Object b) { return epsilon; }
41 public Element _rightparen_(Object e) { return SELF; }
43 public PreSequence _amp_(PreSequence p, Object[] o) {
44 p.needs.add(new PreSequence(o, null, true));
47 public PreSequence _amp__tilde_(PreSequence p, Object[] o) {
48 p.hates.add(new PreSequence(o, null, true));
52 public Element _bang_(Element r) { return r; }
53 public Object care(String s) { return new MyLift(s); }
54 //public Element _backtick_(Element r) { return new Unwrap(r); }
55 //public Element _hash_(Element e) { return e; }
56 //public Element _hash_(Element e) { return _plus__plus_(e); }
58 public PreSequence[] alternatives(PreSequence[] s) { return s; }
60 public Range _minus_(Character a, Character b) { return b==null ? new Range(a.charValue(), true) : new Range(a.charValue(), b.charValue()); }
61 public Union nonTerminalY(String s) { return nonTerminalX(s, false, false); }
62 public Union nonTerminalX(String s, boolean synthetic, boolean dropAll) {
63 Union n = s.equals(startSymbol) ? g : nt.get(s);
64 if (n == null) nt.put(s, n = new Union(s, synthetic));
65 if (dropAll) this.dropAll.add(n);
68 public Object _leftparen_(PreSequence[][] p) { return nonTerminalZ(p); }
69 public Union nonTerminalZ(PreSequence[][] p) { return nonTerminalX("anon"+(anon++), p, false, false); }
70 public Union nonTerminalZ(String s, PreSequence[][] p) { return nonTerminalX(s, p, false, false); }
71 public Union nonTerminalZ(String s, PreSequence[][] p, boolean q) { return nonTerminalX(s, p, false, q); }
72 public Object _backslash__leftbrace_(String s) { return SELF; }
73 public Object _leftbrace_(String s) { return SELF; }
74 public Object _plus_(final Element r) { return new Rep(r, null, false, false); }
75 public Object[] _slash_(Object[] o, Object sep) {
76 if (o.length <= 1) return o;
77 Object[] ret = new Object[o.length * 2 - 1];
78 for(int i=0; i<o.length; i++) {
80 if (i*2+1<ret.length) ret[i*2+1] = new MyDrop(sep);
84 //public Element _tilde__slash__tilde_(final Element r) { return Repeat.maximal(r); }
85 public Object _plus__slash_(final Element r, Object s) {
86 if (s instanceof String) s = CharToken.string((String)s);
87 return new Rep(r, (Element)s, false, false);
89 //public Element _star__slash_(final Element r, Element s) { return Repeat.many0(r, s); }
90 //public Element _star__star_(final Element r, Element s) { return Repeat.maximal(Repeat.many0(r, s)); }
91 public Object _plus__plus_(final Element r) { return new Rep(r, null, true, false); }
92 public Element _question_(final Element r) { return Repeat.maybe(r); }
93 public MetaGrammar gram(Object o, MetaGrammar g, Object o2) { return g; }
94 public MetaGrammar grammar(Object[] o) { return this; }
95 public MetaGrammar grammar(Object o, Union[] u, Object x) { return this; }
96 public char _backslash_n() { return '\n'; }
97 public char _backslash_r() { return '\r'; }
98 public String literal(String s) { return s; }
99 //public Element literal(String s) { return CharToken.string(s); }
101 public Range range0(char a) { return new Range(a, a); }
102 public Range range0(char a, char b) { return new Range(a, b); }
103 public Element range(Object o, Range[] rr) {
104 Range.Set ret = !"~".equals(o+"") ? new Range.Set() : new Range.Set(new Range(true, true));
107 if (!"~".equals(o+"")) ret.add(r);
109 return CharToken.set(ret);
111 public Element rangex(Object o, Object[] r) {
112 Range.Set ret = o==null ? new Range.Set() : new Range.Set(new Range(true, true));
118 : aa instanceof Character
119 ? new Range(((Character)aa).charValue())
120 : new Range(((String)aa).charAt(0));
121 if (o==null) ret.add(range);
122 else ret.remove(range);
124 return CharToken.set(ret);
127 public String sify(Object arg) {
128 if (arg==null) return "";
129 if (arg instanceof String) return (String)arg;
130 Object[] args = (Object[])arg;
132 args = Reflection.lub(args);
133 if (args instanceof String[]) {
134 StringBuffer ret = new StringBuffer();
135 for(String s : ((String[])args)) ret.append(s);
136 return ret.toString();
138 if (args instanceof Character[]) break;
139 if (!(args instanceof Object[])) break;
140 args = (Object[])args[0];
142 if (args instanceof Character[]) {
143 char[] c = new char[args.length];
144 for(int i=0; i<c.length; i++) c[i] = ((Character)args[i]).charValue();
145 String s = new String(c, 0, c.length);
148 return (String)args[0];
152 ////////////////////////////////////////////////////////////////////////////////
155 private HashMap<String,Union> nt;
156 private int anon = 0;
158 private String startSymbol;
160 public MetaGrammar() { this("s"); }
161 public MetaGrammar(String s) { done(s); }
162 public Union done() { return done("s"); }
163 public Union done(String str) {
167 nt = new HashMap<String,Union>();
169 this.dws = Repeat.maximal(Repeat.many0(nonTerminalY("w")));
173 public Union nonTerminalX(String str, PreSequence[][] s, boolean synthetic, boolean dropAll) {
174 Union n = nonTerminalX(str, synthetic, dropAll);
175 if (s == null || s.length==0) { n.add(Sequence.empty); return n; }
176 HashSet<Sequence> seqs = new HashSet<Sequence>();
177 for(int i=0; i<s.length; i++) {
178 if (s[i]==null) continue;
179 HashSet<Sequence> temp = new HashSet<Sequence>();
180 for(PreSequence pre : s[i]) {
181 pre.hatess.addAll(seqs);
182 Sequence seq = pre.buildSequence(Character.isUpperCase(str.charAt(0)) ? dws : null, n, false, dropAll);
184 //for(Sequence dom : seqs) seq.hates.add(dom);
192 public String stringify(String s) { return StringUtil.unescapify(s); }
193 public char unescape(char x, char c) { return unescape(c); }
194 public char unescape(char c) { return StringUtil.unescapify("\\"+c).charAt(0); }
195 public PreSequence sequence(Object[] o) { return new PreSequence(o, null); }
197 public static class PreBrace {
198 public final Object[] o;
199 public PreBrace(Object[] o) { this.o = o; }
202 public PreSequence _equals__greater_(Object[] o, String s) { return new PreSequence(o, s); }
203 public PreSequence wrap(Object[] o) { return new PreSequence(o, ""); }
204 public PreSequence mwrap(Object[] o) { return new PreSequence(o, ""); }
205 public PreSequence rewrite(Object[] o) { return new PreSequence(o, null); }
206 public PreSequence rewrite(Object[] o, Object o2) {
207 Object[] o3 = new Object[o.length + 1];
208 System.arraycopy(o, 0, o3, 0, o.length);
209 o3[o3.length-1] = o2;
213 public static class Rep {
214 private final Element e;
215 private final Element s;
216 private final boolean maximal;
217 private final boolean zero;
218 public Rep(Element e, Element s, boolean maximal, boolean zero) { this.e = e; this.s = s; this.zero = zero; this.maximal = maximal;}
219 public Element build(Element ws) {
221 if (ws==null) sep = s;
222 else if (s==null) sep = ws;
224 Union ws2 = new Union(e + "/" + s + "/" + ws, true);
225 ws2.add(Sequence.singleton(new Element[] { ws, s, ws }, 0, null, null));
228 Element ret = zero ? Repeat.many0(e, sep) : Repeat.many1(e, sep);
229 return maximal ? Repeat.maximal(ret) : ret;
233 public static class PreSequence {
234 public final HashSet<PreSequence> needs = new HashSet<PreSequence>();
235 public final HashSet<PreSequence> hates = new HashSet<PreSequence>();
236 public final HashSet<Sequence> hatess = new HashSet<Sequence>();
237 public /*final*/ String tag;
238 public final Object[] o;
239 public final boolean keeper;
241 public PreSequence(Object[] o, String tag) { this(o, tag, false); }
242 public PreSequence(Object[] o, String tag, boolean keeper) { this.o = o; this.tag = tag; this.keeper = keeper; }
243 boolean[] drops = null;
244 public Element[] expand(Element ws, Union u, HashSet<Sequence> set) {
245 if (o==null) return new Element[0];
246 Element[] o2 = new Element[o.length];
247 drops = new boolean[o.length];
249 for(int i=0; i<o.length; i++) {
251 if (oi instanceof MyDrop) { oi = ((MyDrop)oi).o; drops[j] = true; }
252 if (oi instanceof PreSequence) o2[j] = ((PreSequence)oi).buildUnion(ws);
253 else if (oi==SELF) o2[j] = u.new Subset("(("+u+"))", set);
254 else if (oi instanceof MyLift) { o2[j] = CharToken.string(tag = ((MyLift)oi).s); drops[j] = true; }
255 else if (oi instanceof String) { o2[j] = CharToken.string( ((String)oi) ); drops[j] = true; }
256 else if (oi instanceof Rep) o2[j] = ((Rep)oi).build(ws);
257 //else if (oi instanceof PreBrace) o2[j]
258 else o2[j] = (Element)oi;
260 if (dropAll.contains(o2[j])) drops[j] = true;
265 if (ws == null || o2.length <= 1) return o2;
266 Element[] ret = new Element[o2.length*2-1];
267 boolean[] drops2 = new boolean[ret.length];
268 for(int i=0; i<o2.length; i++) {
269 if (i>0) { ret[i*2-1] = ws; drops2[i*2-1] = true; }
271 drops2[i*2] = drops[i];
276 public Union buildUnion(Element ws) {
277 Union u = new Union("???");
278 u.add(buildSequence(ws, u));
281 public Sequence buildSequence(Element ws, Union u) { return buildSequence(ws, u, false, false); }
282 public Sequence buildSequence(Element ws, Union u, boolean lame, boolean dropAll) {
284 HashSet<Sequence> and = new HashSet<Sequence>();
285 HashSet<Sequence> not = new HashSet<Sequence>();
286 for(PreSequence p : needs) {
287 Sequence ps = p.buildSequence(ws, u, true, dropAll);
291 for(Sequence p : hatess) not.add(p);
292 for(PreSequence p : hates) {
293 Sequence ps = p.buildSequence(ws, u, true, dropAll);
298 HashSet<Sequence> set = new HashSet<Sequence>();
299 Element[] expansion = expand(ws, u, set);
300 boolean keeper = this.keeper;
301 Sequence ret = dropAll || lame || keeper ? Sequence.drop(expansion, and, not, lame) : null;
302 if (ret==null && tag!=null) {
303 for(int i=0; i<expansion.length; i++) expansion[i] = expansion[i];
304 ret = Sequence.rewritingSequence(tag, expansion, drops, and, not);
308 for(int i=0; i<expansion.length; i++) {
309 if (!drops[i]) idx = i;
310 else expansion[i] = expansion[i];
312 ret = idx==-1 ? Sequence.drop(expansion, and, not, false) : Sequence.singleton(expansion, idx, and, not);
319 public static void main(String[] args) throws Exception {
320 if (args.length != 2) {
321 System.err.println("usage: java " + MetaGrammar.class.getName() + " grammarfile.g com.yourdomain.package.ClassName");
325 String className = args[1].substring(args[1].lastIndexOf('.')+1);
326 String packageName = args[1].substring(0, args[1].lastIndexOf('.'));
327 String fileName = packageName.replace('.', '/') + "/" + className + ".java";
329 BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(fileName)));
330 StringBuffer out = new StringBuffer();
332 boolean skip = false;
333 for(String s = br.readLine(); s != null; s = br.readLine()) {
334 if (s.indexOf("DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED") != -1 && s.indexOf("\"")==-1) skip = true;
335 if (s.indexOf("DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED") != -1 && s.indexOf("\"")==-1) break;
336 if (!skip) out.append(s+"\n");
339 out.append("\n // DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED\n");
340 new Parser(MetaGrammar.make(), CharToken.top()).parse1(new CharToken.Stream(new InputStreamReader(new FileInputStream(args[0])))).toJava(out);
341 out.append("\n // DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED\n");
343 for(String s = br.readLine(); s != null; s = br.readLine()) out.append(s+"\n");
346 OutputStream os = new FileOutputStream(fileName);
347 PrintWriter p = new PrintWriter(new OutputStreamWriter(os));
348 p.println(out.toString());
353 public static class MyLift {
354 public final String s;
355 public MyLift(String s) { this.s = s; }
357 public static class MyDrop {
358 public final Object o;
359 public MyDrop(Object o) { this.o = o; }
362 private static final Tree meta =
367 // DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED
368 new Tree(null, "gram", new Tree[] { new Tree(null, null, new Tree[] { }),
369 new Tree(null, "grammar", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { })})}),
370 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { })})})})}),
371 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "G", new Tree[] { }),
372 new Tree(null, "r", new Tree[] { }),
373 new Tree(null, "a", new Tree[] { }),
374 new Tree(null, "m", new Tree[] { }),
375 new Tree(null, "m", new Tree[] { }),
376 new Tree(null, "a", new Tree[] { }),
377 new Tree(null, "r", new Tree[] { })})})}),
378 new Tree(null, "*", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { })})})})})}),
379 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
380 new Tree(null, "r", new Tree[] { }),
381 new Tree(null, "a", new Tree[] { }),
382 new Tree(null, "m", new Tree[] { })})})})})})})}),
383 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "G", new Tree[] { }),
384 new Tree(null, "r", new Tree[] { }),
385 new Tree(null, "a", new Tree[] { }),
386 new Tree(null, "m", new Tree[] { }),
387 new Tree(null, "m", new Tree[] { }),
388 new Tree(null, "a", new Tree[] { }),
389 new Tree(null, "r", new Tree[] { })})}),
390 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "R", new Tree[] { })})})})})}),
391 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
392 new Tree(null, "r", new Tree[] { }),
393 new Tree(null, "a", new Tree[] { }),
394 new Tree(null, "m", new Tree[] { }),
395 new Tree(null, "m", new Tree[] { }),
396 new Tree(null, "a", new Tree[] { }),
397 new Tree(null, "r", new Tree[] { })})})})})})})}),
398 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "R", new Tree[] { })})}),
399 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
400 new Tree(null, "o", new Tree[] { }),
401 new Tree(null, "r", new Tree[] { }),
402 new Tree(null, "d", new Tree[] { })})})}),
403 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ":", new Tree[] { }),
404 new Tree(null, ":", new Tree[] { }),
405 new Tree(null, "=", new Tree[] { })})})}),
406 new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "C", new Tree[] { }),
407 new Tree(null, "l", new Tree[] { }),
408 new Tree(null, "a", new Tree[] { }),
409 new Tree(null, "s", new Tree[] { }),
410 new Tree(null, "s", new Tree[] { })})})}),
411 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
412 new Tree(null, "t", new Tree[] { })})})})})})}),
413 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
414 new Tree(null, "o", new Tree[] { }),
415 new Tree(null, "r", new Tree[] { }),
416 new Tree(null, "d", new Tree[] { })})})}),
417 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "!", new Tree[] { }),
418 new Tree(null, ":", new Tree[] { }),
419 new Tree(null, ":", new Tree[] { }),
420 new Tree(null, "=", new Tree[] { })})})}),
421 new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "C", new Tree[] { }),
422 new Tree(null, "l", new Tree[] { }),
423 new Tree(null, "a", new Tree[] { }),
424 new Tree(null, "s", new Tree[] { }),
425 new Tree(null, "s", new Tree[] { })})})}),
426 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
427 new Tree(null, "t", new Tree[] { })})})})})})})})})})}),
428 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
429 new Tree(null, "c", new Tree[] { })})}),
430 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, "~", new Tree[] { }),
431 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "]", new Tree[] { })}),
432 new Tree(null, "range0", new Tree[] { new Tree(null, "\\", new Tree[] { })}),
433 new Tree(null, "range0", new Tree[] { new Tree(null, "-", new Tree[] { })}),
434 new Tree(null, "range0", new Tree[] { new Tree(null, "~", new Tree[] { })})})})})}),
435 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
436 new Tree(null, "s", new Tree[] { }),
437 new Tree(null, "c", new Tree[] { }),
438 new Tree(null, "a", new Tree[] { }),
439 new Tree(null, "p", new Tree[] { }),
440 new Tree(null, "e", new Tree[] { }),
441 new Tree(null, "d", new Tree[] { })})})})})})})})})}),
442 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "C", new Tree[] { }),
443 new Tree(null, "l", new Tree[] { }),
444 new Tree(null, "a", new Tree[] { }),
445 new Tree(null, "s", new Tree[] { }),
446 new Tree(null, "s", new Tree[] { })})}),
447 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "R", new Tree[] { }),
448 new Tree(null, "e", new Tree[] { }),
449 new Tree(null, "w", new Tree[] { }),
450 new Tree(null, "r", new Tree[] { }),
451 new Tree(null, "i", new Tree[] { }),
452 new Tree(null, "t", new Tree[] { }),
453 new Tree(null, "e", new Tree[] { })})})}),
454 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "b", new Tree[] { }),
455 new Tree(null, "a", new Tree[] { }),
456 new Tree(null, "r", new Tree[] { })})})})})}),
457 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "a", new Tree[] { }),
458 new Tree(null, "l", new Tree[] { }),
459 new Tree(null, "t", new Tree[] { }),
460 new Tree(null, "e", new Tree[] { }),
461 new Tree(null, "r", new Tree[] { }),
462 new Tree(null, "n", new Tree[] { }),
463 new Tree(null, "a", new Tree[] { }),
464 new Tree(null, "t", new Tree[] { }),
465 new Tree(null, "i", new Tree[] { }),
466 new Tree(null, "v", new Tree[] { }),
467 new Tree(null, "e", new Tree[] { }),
468 new Tree(null, "s", new Tree[] { })})})})})})})}),
469 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "R", new Tree[] { }),
470 new Tree(null, "e", new Tree[] { }),
471 new Tree(null, "w", new Tree[] { }),
472 new Tree(null, "r", new Tree[] { }),
473 new Tree(null, "i", new Tree[] { }),
474 new Tree(null, "t", new Tree[] { }),
475 new Tree(null, "e", new Tree[] { })})}),
476 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "R", new Tree[] { }),
477 new Tree(null, "e", new Tree[] { }),
478 new Tree(null, "w", new Tree[] { }),
479 new Tree(null, "r", new Tree[] { }),
480 new Tree(null, "i", new Tree[] { }),
481 new Tree(null, "t", new Tree[] { }),
482 new Tree(null, "e", new Tree[] { }),
483 new Tree(null, "x", new Tree[] { })})})})})}),
484 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "R", new Tree[] { }),
485 new Tree(null, "e", new Tree[] { }),
486 new Tree(null, "w", new Tree[] { }),
487 new Tree(null, "r", new Tree[] { }),
488 new Tree(null, "i", new Tree[] { }),
489 new Tree(null, "t", new Tree[] { }),
490 new Tree(null, "e", new Tree[] { }),
491 new Tree(null, "x", new Tree[] { })})})}),
492 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "&", new Tree[] { })})})}),
493 new Tree(null, "+", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})})}),
494 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "R", new Tree[] { }),
495 new Tree(null, "e", new Tree[] { }),
496 new Tree(null, "w", new Tree[] { }),
497 new Tree(null, "r", new Tree[] { }),
498 new Tree(null, "i", new Tree[] { }),
499 new Tree(null, "t", new Tree[] { }),
500 new Tree(null, "e", new Tree[] { }),
501 new Tree(null, "x", new Tree[] { })})})}),
502 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "&", new Tree[] { }),
503 new Tree(null, "~", new Tree[] { })})})}),
504 new Tree(null, "+", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})})})})})})}),
505 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "R", new Tree[] { }),
506 new Tree(null, "e", new Tree[] { }),
507 new Tree(null, "w", new Tree[] { }),
508 new Tree(null, "r", new Tree[] { }),
509 new Tree(null, "i", new Tree[] { }),
510 new Tree(null, "t", new Tree[] { }),
511 new Tree(null, "e", new Tree[] { }),
512 new Tree(null, "x", new Tree[] { })})}),
513 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
514 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
515 new Tree(null, "e", new Tree[] { }),
516 new Tree(null, "w", new Tree[] { }),
517 new Tree(null, "r", new Tree[] { }),
518 new Tree(null, "i", new Tree[] { }),
519 new Tree(null, "t", new Tree[] { }),
520 new Tree(null, "e", new Tree[] { })})})}),
521 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})}),
522 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=", new Tree[] { }),
523 new Tree(null, ">", new Tree[] { })})})}),
524 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
525 new Tree(null, "o", new Tree[] { }),
526 new Tree(null, "r", new Tree[] { }),
527 new Tree(null, "d", new Tree[] { })})})})})}),
528 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})}),
529 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=", new Tree[] { }),
530 new Tree(null, ">", new Tree[] { })})})}),
531 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
532 new Tree(null, "u", new Tree[] { }),
533 new Tree(null, "o", new Tree[] { }),
534 new Tree(null, "t", new Tree[] { }),
535 new Tree(null, "e", new Tree[] { }),
536 new Tree(null, "d", new Tree[] { })})})})})}),
537 new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})}),
538 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=", new Tree[] { }),
539 new Tree(null, ">", new Tree[] { })})})}),
540 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { }),
541 new Tree(null, ")", new Tree[] { })})})})}),
542 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
543 new Tree(null, "r", new Tree[] { }),
544 new Tree(null, "a", new Tree[] { }),
545 new Tree(null, "p", new Tree[] { })})})})})})})}),
546 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
547 new Tree(null, "a", new Tree[] { }),
548 new Tree(null, "n", new Tree[] { }),
549 new Tree(null, "g", new Tree[] { }),
550 new Tree(null, "e", new Tree[] { })})}),
551 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
552 new Tree(null, "c", new Tree[] { })})})})}),
553 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
554 new Tree(null, "a", new Tree[] { }),
555 new Tree(null, "n", new Tree[] { }),
556 new Tree(null, "g", new Tree[] { }),
557 new Tree(null, "e", new Tree[] { }),
558 new Tree(null, "0", new Tree[] { })})})}),
559 new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
560 new Tree(null, "c", new Tree[] { })})})}),
561 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "-", new Tree[] { })})})}),
562 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
563 new Tree(null, "c", new Tree[] { })})})})}),
564 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
565 new Tree(null, "a", new Tree[] { }),
566 new Tree(null, "n", new Tree[] { }),
567 new Tree(null, "g", new Tree[] { }),
568 new Tree(null, "e", new Tree[] { }),
569 new Tree(null, "0", new Tree[] { })})})})})})})}),
570 new Tree(null, "!::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
571 new Tree(null, "t", new Tree[] { })})}),
572 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ">", new Tree[] { })})})})})})})})})}),
573 new Tree(null, "!::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "b", new Tree[] { }),
574 new Tree(null, "a", new Tree[] { }),
575 new Tree(null, "r", new Tree[] { })})}),
576 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "|", new Tree[] { })})})})})})})})})}),
577 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})}),
578 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
579 new Tree(null, "o", new Tree[] { }),
580 new Tree(null, "r", new Tree[] { }),
581 new Tree(null, "d", new Tree[] { })})})})}),
582 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "n", new Tree[] { }),
583 new Tree(null, "o", new Tree[] { }),
584 new Tree(null, "n", new Tree[] { }),
585 new Tree(null, "T", new Tree[] { }),
586 new Tree(null, "e", new Tree[] { }),
587 new Tree(null, "r", new Tree[] { }),
588 new Tree(null, "m", new Tree[] { }),
589 new Tree(null, "i", new Tree[] { }),
590 new Tree(null, "n", new Tree[] { }),
591 new Tree(null, "a", new Tree[] { }),
592 new Tree(null, "l", new Tree[] { }),
593 new Tree(null, "Y", new Tree[] { })})})}),
594 new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, null, new Tree[] { }),
595 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "(", new Tree[] { })})})}),
596 new Tree(null, "range", new Tree[] { new Tree(null, null, new Tree[] { }),
597 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, ")", new Tree[] { })})})})}),
598 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
599 new Tree(null, "p", new Tree[] { }),
600 new Tree(null, "s", new Tree[] { }),
601 new Tree(null, "i", new Tree[] { }),
602 new Tree(null, "l", new Tree[] { }),
603 new Tree(null, "o", new Tree[] { }),
604 new Tree(null, "n", new Tree[] { })})})}),
605 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "{", new Tree[] { })})})}),
606 new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "C", new Tree[] { }),
607 new Tree(null, "l", new Tree[] { }),
608 new Tree(null, "a", new Tree[] { }),
609 new Tree(null, "s", new Tree[] { }),
610 new Tree(null, "s", new Tree[] { })})})}),
611 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
612 new Tree(null, "t", new Tree[] { })})})})}),
613 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "}", new Tree[] { })})})})})}),
614 new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "[", new Tree[] { })})})}),
615 new Tree(null, "?", new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, null, new Tree[] { }),
616 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "~", new Tree[] { })})})})}),
617 new Tree(null, "*", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
618 new Tree(null, "a", new Tree[] { }),
619 new Tree(null, "n", new Tree[] { }),
620 new Tree(null, "g", new Tree[] { }),
621 new Tree(null, "e", new Tree[] { })})})})}),
622 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "]", new Tree[] { })})})})}),
623 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
624 new Tree(null, "a", new Tree[] { }),
625 new Tree(null, "n", new Tree[] { }),
626 new Tree(null, "g", new Tree[] { }),
627 new Tree(null, "e", new Tree[] { })})})}),
628 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})}),
629 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { }),
630 new Tree(null, "/", new Tree[] { })})})}),
631 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
632 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})}),
633 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { }),
634 new Tree(null, "/", new Tree[] { })})})}),
635 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
636 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})}),
637 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "?", new Tree[] { })})})})})}),
638 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})}),
639 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "~", new Tree[] { }),
640 new Tree(null, "/", new Tree[] { }),
641 new Tree(null, "~", new Tree[] { })})})})})}),
642 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})}),
643 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "-", new Tree[] { })})})}),
644 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
645 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "!", new Tree[] { })})})}),
646 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
647 new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "^", new Tree[] { })})})}),
648 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
649 new Tree(null, "u", new Tree[] { }),
650 new Tree(null, "o", new Tree[] { }),
651 new Tree(null, "t", new Tree[] { }),
652 new Tree(null, "e", new Tree[] { }),
653 new Tree(null, "d", new Tree[] { })})})})}),
654 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "c", new Tree[] { }),
655 new Tree(null, "a", new Tree[] { }),
656 new Tree(null, "r", new Tree[] { }),
657 new Tree(null, "e", new Tree[] { })})})}),
658 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "`", new Tree[] { })})})}),
659 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
660 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})}),
661 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "#", new Tree[] { })})})})})}),
662 new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
663 new Tree(null, "u", new Tree[] { }),
664 new Tree(null, "o", new Tree[] { }),
665 new Tree(null, "t", new Tree[] { }),
666 new Tree(null, "e", new Tree[] { }),
667 new Tree(null, "d", new Tree[] { })})})})}),
668 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "l", new Tree[] { }),
669 new Tree(null, "i", new Tree[] { }),
670 new Tree(null, "t", new Tree[] { }),
671 new Tree(null, "e", new Tree[] { }),
672 new Tree(null, "r", new Tree[] { }),
673 new Tree(null, "a", new Tree[] { }),
674 new Tree(null, "l", new Tree[] { })})})}),
675 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})}),
676 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { }),
677 new Tree(null, "*", new Tree[] { })})})})})})})}),
678 new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})}),
679 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { })})})})})})})})})})})}),
680 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})}),
681 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { }),
682 new Tree(null, "+", new Tree[] { })})})})})})})}),
683 new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})}),
684 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { })})})})})})})})})})})}),
685 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { })})})}),
686 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
687 new Tree(null, "o", new Tree[] { }),
688 new Tree(null, "r", new Tree[] { }),
689 new Tree(null, "d", new Tree[] { })})})}),
690 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ")", new Tree[] { })})})})})})})}),
691 new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { })})})}),
692 new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "C", new Tree[] { }),
693 new Tree(null, "l", new Tree[] { }),
694 new Tree(null, "a", new Tree[] { }),
695 new Tree(null, "s", new Tree[] { }),
696 new Tree(null, "s", new Tree[] { })})})}),
697 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
698 new Tree(null, "t", new Tree[] { })})})})}),
699 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ")", new Tree[] { })})})})})})})})})}),
700 new Tree(null, "!::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { })})}),
701 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, " ", new Tree[] { })})})})})}),
702 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "/", new Tree[] { }),
703 new Tree(null, "/", new Tree[] { })})})}),
704 new Tree(null, "*", new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, "~", new Tree[] { }),
705 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "\n", new Tree[] { })})})})}),
706 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\n", new Tree[] { })})})})})}),
707 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\n", new Tree[] { })})})})})}),
708 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\r", new Tree[] { })})})})})})})})})}),
709 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "a", new Tree[] { }),
710 new Tree(null, "n", new Tree[] { })})}),
711 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, null, new Tree[] { }),
712 new Tree(null, null, new Tree[] { new Tree(null, "-", new Tree[] { new Tree(null, "a", new Tree[] { }),
713 new Tree(null, "z", new Tree[] { })}),
714 new Tree(null, "-", new Tree[] { new Tree(null, "A", new Tree[] { }),
715 new Tree(null, "Z", new Tree[] { })}),
716 new Tree(null, "-", new Tree[] { new Tree(null, "0", new Tree[] { }),
717 new Tree(null, "9", new Tree[] { })}),
718 new Tree(null, "range0", new Tree[] { new Tree(null, "_", new Tree[] { })})})})})})})})})}),
719 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
720 new Tree(null, "o", new Tree[] { }),
721 new Tree(null, "r", new Tree[] { }),
722 new Tree(null, "d", new Tree[] { })})}),
723 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "++", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "a", new Tree[] { }),
724 new Tree(null, "n", new Tree[] { })})})})})}),
725 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { }),
726 new Tree(null, "i", new Tree[] { }),
727 new Tree(null, "f", new Tree[] { }),
728 new Tree(null, "y", new Tree[] { })})})})})})})}),
729 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
730 new Tree(null, "u", new Tree[] { }),
731 new Tree(null, "o", new Tree[] { }),
732 new Tree(null, "t", new Tree[] { }),
733 new Tree(null, "e", new Tree[] { }),
734 new Tree(null, "d", new Tree[] { })})}),
735 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\"", new Tree[] { })})})}),
736 new Tree(null, "*", new Tree[] { new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, "~", new Tree[] { }),
737 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "\"", new Tree[] { })}),
738 new Tree(null, "range0", new Tree[] { new Tree(null, "\\", new Tree[] { })})})})})}),
739 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
740 new Tree(null, "s", new Tree[] { }),
741 new Tree(null, "c", new Tree[] { }),
742 new Tree(null, "a", new Tree[] { }),
743 new Tree(null, "p", new Tree[] { }),
744 new Tree(null, "e", new Tree[] { }),
745 new Tree(null, "d", new Tree[] { })})})})})})})})})})}),
746 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\"", new Tree[] { })})})})}),
747 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { }),
748 new Tree(null, "i", new Tree[] { }),
749 new Tree(null, "f", new Tree[] { }),
750 new Tree(null, "y", new Tree[] { })})})})})})})}),
751 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
752 new Tree(null, "s", new Tree[] { }),
753 new Tree(null, "c", new Tree[] { }),
754 new Tree(null, "a", new Tree[] { }),
755 new Tree(null, "p", new Tree[] { }),
756 new Tree(null, "e", new Tree[] { }),
757 new Tree(null, "d", new Tree[] { })})}),
758 new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\\", new Tree[] { }),
759 new Tree(null, "n", new Tree[] { })})})})}),
760 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\n", new Tree[] { })})})}),
761 new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\\", new Tree[] { }),
762 new Tree(null, "r", new Tree[] { })})})})}),
763 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\r", new Tree[] { })})})}),
764 new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\\", new Tree[] { })})})}),
765 new Tree(null, "range", new Tree[] { new Tree(null, "~", new Tree[] { }),
766 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "n", new Tree[] { })}),
767 new Tree(null, "range0", new Tree[] { new Tree(null, "r", new Tree[] { })})})})})})})})})})})}),
768 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { })})})
769 // DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED