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 (oi instanceof Rep) oi = ((Rep)oi).build(new MyDrop(sep));
82 if (i*2+1<ret.length) ret[i*2+1] = new MyDrop(sep);
86 //public Element _tilde__slash__tilde_(final Element r) { return Repeat.maximal(r); }
87 public Object _plus__slash_(final Element r, Object s) {
88 if (s instanceof String) s = CharToken.string((String)s);
89 return new Rep(r, (Element)s, false, false);
91 public Object _star__slash_(final Element r, Object s) {
92 if (s instanceof String) s = CharToken.string((String)s);
93 return new Rep(r, (Element)s, false, true);
95 //public Element _star__slash_(final Element r, Element s) { return Repeat.many0(r, s); }
96 public Object _star__star_(final Element r) { return new Rep(r, null, true, true); }
97 public Object _plus__plus_(final Element r) { return new Rep(r, null, true, false); }
98 public Element _question_(final Element r) { return Repeat.maybe(r); }
99 public MetaGrammar gram(Object o, MetaGrammar g, Object o2) { return g; }
100 public MetaGrammar grammar(Object[] o) { return this; }
101 public MetaGrammar grammar(Object o, Union[] u, Object x) { return this; }
102 public char _backslash_n() { return '\n'; }
103 public char _backslash_r() { return '\r'; }
104 public String literal(String s) { return s; }
105 //public Element literal(String s) { return CharToken.string(s); }
107 public Range range0(char a) { return new Range(a, a); }
108 public Range range0(char a, char b) { return new Range(a, b); }
109 public Element range(Object o, Range[] rr) {
110 Range.Set ret = !"~".equals(o+"") ? new Range.Set() : new Range.Set(new Range(true, true));
113 if (!"~".equals(o+"")) ret.add(r);
115 return CharToken.set(ret);
117 public Element rangex(Object o, Object[] r) {
118 Range.Set ret = o==null ? new Range.Set() : new Range.Set(new Range(true, true));
124 : aa instanceof Character
125 ? new Range(((Character)aa).charValue())
126 : new Range(((String)aa).charAt(0));
127 if (o==null) ret.add(range);
128 else ret.remove(range);
130 return CharToken.set(ret);
133 public String sify(Object arg) {
134 if (arg==null) return "";
135 if (arg instanceof String) return (String)arg;
136 Object[] args = (Object[])arg;
138 args = Reflection.lub(args);
139 if (args instanceof String[]) {
140 StringBuffer ret = new StringBuffer();
141 for(String s : ((String[])args)) ret.append(s);
142 return ret.toString();
144 if (args instanceof Character[]) break;
145 if (!(args instanceof Object[])) break;
146 args = (Object[])args[0];
148 if (args instanceof Character[]) {
149 char[] c = new char[args.length];
150 for(int i=0; i<c.length; i++) c[i] = ((Character)args[i]).charValue();
151 String s = new String(c, 0, c.length);
154 return (String)args[0];
158 ////////////////////////////////////////////////////////////////////////////////
161 private HashMap<String,Union> nt;
162 private int anon = 0;
164 private String startSymbol;
166 public MetaGrammar() { this("s"); }
167 public MetaGrammar(String s) { done(s); }
168 public Union done() { return done("s"); }
169 public Union done(String str) {
173 nt = new HashMap<String,Union>();
175 this.dws = Repeat.maximal(Repeat.many0(nonTerminalY("w")));
179 public Union nonTerminalX(String str, PreSequence[][] s, boolean synthetic, boolean dropAll) {
180 Union n = nonTerminalX(str, synthetic, dropAll);
181 if (s == null || s.length==0) { n.add(Sequence.empty); return n; }
182 HashSet<Sequence> seqs = new HashSet<Sequence>();
183 for(int i=0; i<s.length; i++) {
184 if (s[i]==null) continue;
185 HashSet<Sequence> temp = new HashSet<Sequence>();
186 for(PreSequence pre : s[i]) {
187 pre.hatess.addAll(seqs);
188 Sequence seq = pre.buildSequence(Character.isUpperCase(str.charAt(0)) ? dws : null, n, false, dropAll);
190 //for(Sequence dom : seqs) seq.hates.add(dom);
198 public String stringify(String s) { return StringUtil.unescapify(s); }
199 public char unescape(char x, char c) { return unescape(c); }
200 public char unescape(char c) { return StringUtil.unescapify("\\"+c).charAt(0); }
201 public PreSequence sequence(Object[] o) { return new PreSequence(o, null); }
203 public static class PreBrace {
204 public final Object[] o;
205 public PreBrace(Object[] o) { this.o = o; }
208 public PreSequence _equals__greater_(Object[] o, String s) { return new PreSequence(o, s); }
209 public PreSequence wrap(Object[] o) { return new PreSequence(o, ""); }
210 public PreSequence mwrap(Object[] o) { return new PreSequence(o, ""); }
211 public PreSequence rewrite(Object[] o) { return new PreSequence(o, null); }
212 public PreSequence rewrite(Object[] o, Object o2) {
213 Object[] o3 = new Object[o.length + 1];
214 System.arraycopy(o, 0, o3, 0, o.length);
215 o3[o3.length-1] = o2;
219 public static class Rep {
220 private final Element e;
221 private final Element s;
222 private final boolean maximal;
223 private final boolean zero;
224 public Rep(Element e, Element s, boolean maximal, boolean zero) { this.e = e; this.s = s; this.zero = zero; this.maximal = maximal;}
225 public Element build(Element ws) {
227 if (ws==null) sep = s;
228 else if (s==null) sep = ws;
230 Union ws2 = new Union(e + "/" + s + "/" + ws, true);
231 ws2.add(Sequence.singleton(new Element[] { ws, s, ws }, 0, null, null));
234 Element ret = zero ? Repeat.many0(e, sep) : Repeat.many1(e, sep);
235 return maximal ? Repeat.maximal(ret) : ret;
239 public static class PreSequence {
240 public final HashSet<PreSequence> needs = new HashSet<PreSequence>();
241 public final HashSet<PreSequence> hates = new HashSet<PreSequence>();
242 public final HashSet<Sequence> hatess = new HashSet<Sequence>();
243 public /*final*/ String tag;
244 public final Object[] o;
245 public final boolean keeper;
247 public PreSequence(Object[] o, String tag) { this(o, tag, false); }
248 public PreSequence(Object[] o, String tag, boolean keeper) { this.o = o; this.tag = tag; this.keeper = keeper; }
249 boolean[] drops = null;
250 public Element[] expand(Element ws, Union u, HashSet<Sequence> set) {
251 if (o==null) return new Element[0];
252 Element[] o2 = new Element[o.length];
253 drops = new boolean[o.length];
255 for(int i=0; i<o.length; i++) {
257 if (oi instanceof MyDrop) { oi = ((MyDrop)oi).o; drops[j] = true; }
258 if (oi instanceof PreSequence) o2[j] = ((PreSequence)oi).buildUnion(ws);
259 else if (oi==SELF) o2[j] = u.new Subset("(("+u+"))", set);
260 else if (oi instanceof MyLift) { o2[j] = CharToken.string(tag = ((MyLift)oi).s); drops[j] = true; }
261 else if (oi instanceof String) { o2[j] = CharToken.string( ((String)oi) ); drops[j] = true; }
262 else if (oi instanceof Rep) o2[j] = ((Rep)oi).build(ws);
263 //else if (oi instanceof PreBrace) o2[j]
264 else o2[j] = (Element)oi;
266 if (dropAll.contains(o2[j])) drops[j] = true;
271 if (ws == null || o2.length <= 1) return o2;
272 Element[] ret = new Element[o2.length*2-1];
273 boolean[] drops2 = new boolean[ret.length];
274 for(int i=0; i<o2.length; i++) {
275 if (i>0) { ret[i*2-1] = ws; drops2[i*2-1] = true; }
277 drops2[i*2] = drops[i];
282 public Union buildUnion(Element ws) {
283 Union u = new Union("???");
284 u.add(buildSequence(ws, u));
287 public Sequence buildSequence(Element ws, Union u) { return buildSequence(ws, u, false, false); }
288 public Sequence buildSequence(Element ws, Union u, boolean lame, boolean dropAll) {
290 HashSet<Sequence> and = new HashSet<Sequence>();
291 HashSet<Sequence> not = new HashSet<Sequence>();
292 for(PreSequence p : needs) {
293 Sequence ps = p.buildSequence(ws, u, true, dropAll);
297 for(Sequence p : hatess) not.add(p);
298 for(PreSequence p : hates) {
299 Sequence ps = p.buildSequence(ws, u, true, dropAll);
304 HashSet<Sequence> set = new HashSet<Sequence>();
305 Element[] expansion = expand(ws, u, set);
306 boolean keeper = this.keeper;
307 Sequence ret = dropAll || lame || keeper ? Sequence.drop(expansion, and, not, lame) : null;
308 if (ret==null && tag!=null) {
309 for(int i=0; i<expansion.length; i++) expansion[i] = expansion[i];
310 ret = Sequence.rewritingSequence(tag, expansion, drops, and, not);
314 for(int i=0; i<expansion.length; i++) {
315 if (!drops[i]) idx = i;
316 else expansion[i] = expansion[i];
318 ret = idx==-1 ? Sequence.drop(expansion, and, not, false) : Sequence.singleton(expansion, idx, and, not);
325 public static void main(String[] args) throws Exception {
326 if (args.length != 2) {
327 System.err.println("usage: java " + MetaGrammar.class.getName() + " grammarfile.g com.yourdomain.package.ClassName");
331 String className = args[1].substring(args[1].lastIndexOf('.')+1);
332 String packageName = args[1].substring(0, args[1].lastIndexOf('.'));
333 String fileName = packageName.replace('.', '/') + "/" + className + ".java";
335 BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(fileName)));
336 StringBuffer out = new StringBuffer();
338 boolean skip = false;
339 for(String s = br.readLine(); s != null; s = br.readLine()) {
340 if (s.indexOf("DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED") != -1 && s.indexOf("\"")==-1) skip = true;
341 if (s.indexOf("DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED") != -1 && s.indexOf("\"")==-1) break;
342 if (!skip) out.append(s+"\n");
345 out.append("\n // DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED\n");
346 new Parser(MetaGrammar.make(), CharToken.top()).parse1(new CharToken.Stream(new InputStreamReader(new FileInputStream(args[0])))).toJava(out);
347 out.append("\n // DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED\n");
349 for(String s = br.readLine(); s != null; s = br.readLine()) out.append(s+"\n");
352 OutputStream os = new FileOutputStream(fileName);
353 PrintWriter p = new PrintWriter(new OutputStreamWriter(os));
354 p.println(out.toString());
359 public static class MyLift {
360 public final String s;
361 public MyLift(String s) { this.s = s; }
363 public static class MyDrop {
364 public final Object o;
365 public MyDrop(Object o) { this.o = o; }
368 private static final Tree meta =
374 // DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED
375 new Tree(null, "gram", new Tree[] { new Tree(null, null, new Tree[] { }),
376 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[] { })})}),
377 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[] { })})})})}),
378 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "G", new Tree[] { }),
379 new Tree(null, "r", new Tree[] { }),
380 new Tree(null, "a", new Tree[] { }),
381 new Tree(null, "m", new Tree[] { }),
382 new Tree(null, "m", new Tree[] { }),
383 new Tree(null, "a", new Tree[] { }),
384 new Tree(null, "r", new Tree[] { })})})}),
385 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[] { })})})})})}),
386 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
387 new Tree(null, "r", new Tree[] { }),
388 new Tree(null, "a", new Tree[] { }),
389 new Tree(null, "m", new Tree[] { })})})})})})})}),
390 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "G", new Tree[] { }),
391 new Tree(null, "r", new Tree[] { }),
392 new Tree(null, "a", new Tree[] { }),
393 new Tree(null, "m", new Tree[] { }),
394 new Tree(null, "m", new Tree[] { }),
395 new Tree(null, "a", new Tree[] { }),
396 new Tree(null, "r", new Tree[] { })})}),
397 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[] { })})})})})}),
398 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
399 new Tree(null, "r", new Tree[] { }),
400 new Tree(null, "a", new Tree[] { }),
401 new Tree(null, "m", new Tree[] { }),
402 new Tree(null, "m", new Tree[] { }),
403 new Tree(null, "a", new Tree[] { }),
404 new Tree(null, "r", new Tree[] { })})})})})})})}),
405 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "R", new Tree[] { })})}),
406 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[] { }),
407 new Tree(null, "o", new Tree[] { }),
408 new Tree(null, "r", new Tree[] { }),
409 new Tree(null, "d", new Tree[] { })})})}),
410 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ":", new Tree[] { }),
411 new Tree(null, ":", new Tree[] { }),
412 new Tree(null, "=", new Tree[] { })})})}),
413 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "A", new Tree[] { }),
414 new Tree(null, "l", new Tree[] { }),
415 new Tree(null, "t", new Tree[] { }),
416 new Tree(null, "e", new Tree[] { }),
417 new Tree(null, "r", new Tree[] { }),
418 new Tree(null, "n", new Tree[] { }),
419 new Tree(null, "a", new Tree[] { }),
420 new Tree(null, "t", new Tree[] { }),
421 new Tree(null, "i", new Tree[] { }),
422 new Tree(null, "v", new Tree[] { }),
423 new Tree(null, "e", new Tree[] { }),
424 new Tree(null, "s", new Tree[] { })})})})})}),
425 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[] { }),
426 new Tree(null, "o", new Tree[] { }),
427 new Tree(null, "r", new Tree[] { }),
428 new Tree(null, "d", new Tree[] { })})})}),
429 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "!", new Tree[] { }),
430 new Tree(null, ":", new Tree[] { }),
431 new Tree(null, ":", new Tree[] { }),
432 new Tree(null, "=", new Tree[] { })})})}),
433 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "A", new Tree[] { }),
434 new Tree(null, "l", new Tree[] { }),
435 new Tree(null, "t", new Tree[] { }),
436 new Tree(null, "e", new Tree[] { }),
437 new Tree(null, "r", new Tree[] { }),
438 new Tree(null, "n", new Tree[] { }),
439 new Tree(null, "a", new Tree[] { }),
440 new Tree(null, "t", new Tree[] { }),
441 new Tree(null, "i", new Tree[] { }),
442 new Tree(null, "v", new Tree[] { }),
443 new Tree(null, "e", new Tree[] { }),
444 new Tree(null, "s", new Tree[] { })})})})})})})})})}),
445 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
446 new Tree(null, "c", new Tree[] { })})}),
447 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[] { }),
448 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "]", new Tree[] { })}),
449 new Tree(null, "range0", new Tree[] { new Tree(null, "\\", new Tree[] { })}),
450 new Tree(null, "range0", new Tree[] { new Tree(null, "-", new Tree[] { })}),
451 new Tree(null, "range0", new Tree[] { new Tree(null, "~", new Tree[] { })})})})})}),
452 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[] { }),
453 new Tree(null, "s", new Tree[] { }),
454 new Tree(null, "c", new Tree[] { }),
455 new Tree(null, "a", new Tree[] { }),
456 new Tree(null, "p", new Tree[] { }),
457 new Tree(null, "e", new Tree[] { }),
458 new Tree(null, "d", new Tree[] { })})})})})})})})})}),
459 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "A", new Tree[] { }),
460 new Tree(null, "l", new Tree[] { }),
461 new Tree(null, "t", new Tree[] { }),
462 new Tree(null, "e", new Tree[] { }),
463 new Tree(null, "r", new Tree[] { }),
464 new Tree(null, "n", new Tree[] { }),
465 new Tree(null, "a", new Tree[] { }),
466 new Tree(null, "t", new Tree[] { }),
467 new Tree(null, "i", new Tree[] { }),
468 new Tree(null, "v", new Tree[] { }),
469 new Tree(null, "e", new Tree[] { }),
470 new Tree(null, "s", new Tree[] { })})}),
471 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, "+/", 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[] { }),
472 new Tree(null, "q", new Tree[] { }),
473 new Tree(null, "u", new Tree[] { }),
474 new Tree(null, "i", new Tree[] { }),
475 new Tree(null, "A", new Tree[] { }),
476 new Tree(null, "l", new Tree[] { }),
477 new Tree(null, "t", new Tree[] { })})})}),
478 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ">", new Tree[] { })})})})})})})})})})}),
479 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { }),
480 new Tree(null, "q", new Tree[] { }),
481 new Tree(null, "u", new Tree[] { }),
482 new Tree(null, "i", new Tree[] { }),
483 new Tree(null, "A", new Tree[] { }),
484 new Tree(null, "l", new Tree[] { }),
485 new Tree(null, "t", new Tree[] { })})}),
486 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, "C", new Tree[] { }),
487 new Tree(null, "o", new Tree[] { }),
488 new Tree(null, "n", new Tree[] { }),
489 new Tree(null, "j", new Tree[] { }),
490 new Tree(null, "u", new Tree[] { }),
491 new Tree(null, "n", new Tree[] { }),
492 new Tree(null, "c", new Tree[] { }),
493 new Tree(null, "t", new Tree[] { }),
494 new Tree(null, "s", new Tree[] { })})})}),
495 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "|", new Tree[] { })})})})})}),
496 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "a", new Tree[] { }),
497 new Tree(null, "l", new Tree[] { }),
498 new Tree(null, "t", new Tree[] { }),
499 new Tree(null, "e", new Tree[] { }),
500 new Tree(null, "r", new Tree[] { }),
501 new Tree(null, "n", new Tree[] { }),
502 new Tree(null, "a", new Tree[] { }),
503 new Tree(null, "t", new Tree[] { }),
504 new Tree(null, "i", new Tree[] { }),
505 new Tree(null, "v", new Tree[] { }),
506 new Tree(null, "e", new Tree[] { }),
507 new Tree(null, "s", new Tree[] { })})})})})})})}),
508 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "S", new Tree[] { }),
509 new Tree(null, "e", new Tree[] { }),
510 new Tree(null, "q", new Tree[] { }),
511 new Tree(null, "u", new Tree[] { }),
512 new Tree(null, "e", new Tree[] { }),
513 new Tree(null, "n", new Tree[] { }),
514 new Tree(null, "c", new Tree[] { }),
515 new Tree(null, "e", new Tree[] { })})}),
516 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, "+", 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[] { })})})})}),
517 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "/", new Tree[] { })})})}),
518 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})})})}),
519 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, "+", 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[] { })})})})})})})})})})}),
520 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "C", new Tree[] { }),
521 new Tree(null, "o", new Tree[] { }),
522 new Tree(null, "n", new Tree[] { }),
523 new Tree(null, "j", new Tree[] { }),
524 new Tree(null, "u", new Tree[] { }),
525 new Tree(null, "n", new Tree[] { }),
526 new Tree(null, "c", new Tree[] { }),
527 new Tree(null, "t", new Tree[] { }),
528 new Tree(null, "s", new Tree[] { })})}),
529 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[] { }),
530 new Tree(null, "e", new Tree[] { }),
531 new Tree(null, "w", new Tree[] { }),
532 new Tree(null, "r", new Tree[] { }),
533 new Tree(null, "i", new Tree[] { }),
534 new Tree(null, "t", new Tree[] { }),
535 new Tree(null, "e", new Tree[] { })})})})})}),
536 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[] { }),
537 new Tree(null, "e", new Tree[] { }),
538 new Tree(null, "w", new Tree[] { }),
539 new Tree(null, "r", new Tree[] { }),
540 new Tree(null, "i", new Tree[] { }),
541 new Tree(null, "t", new Tree[] { }),
542 new Tree(null, "e", new Tree[] { })})})}),
543 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "&", new Tree[] { })})})}),
544 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "S", new Tree[] { }),
545 new Tree(null, "e", new Tree[] { }),
546 new Tree(null, "q", new Tree[] { }),
547 new Tree(null, "u", new Tree[] { }),
548 new Tree(null, "e", new Tree[] { }),
549 new Tree(null, "n", new Tree[] { }),
550 new Tree(null, "c", new Tree[] { }),
551 new Tree(null, "e", new Tree[] { })})})})})}),
552 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[] { }),
553 new Tree(null, "e", new Tree[] { }),
554 new Tree(null, "w", new Tree[] { }),
555 new Tree(null, "r", new Tree[] { }),
556 new Tree(null, "i", new Tree[] { }),
557 new Tree(null, "t", new Tree[] { }),
558 new Tree(null, "e", new Tree[] { })})})}),
559 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "&", new Tree[] { }),
560 new Tree(null, "~", new Tree[] { })})})}),
561 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "S", new Tree[] { }),
562 new Tree(null, "e", new Tree[] { }),
563 new Tree(null, "q", new Tree[] { }),
564 new Tree(null, "u", new Tree[] { }),
565 new Tree(null, "e", new Tree[] { }),
566 new Tree(null, "n", new Tree[] { }),
567 new Tree(null, "c", new Tree[] { }),
568 new Tree(null, "e", new Tree[] { })})})})})})})})})}),
569 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "R", new Tree[] { }),
570 new Tree(null, "e", new Tree[] { }),
571 new Tree(null, "w", new Tree[] { }),
572 new Tree(null, "r", new Tree[] { }),
573 new Tree(null, "i", new Tree[] { }),
574 new Tree(null, "t", new Tree[] { }),
575 new Tree(null, "e", new Tree[] { })})}),
576 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, "S", new Tree[] { }),
577 new Tree(null, "e", new Tree[] { }),
578 new Tree(null, "q", new Tree[] { }),
579 new Tree(null, "u", new Tree[] { }),
580 new Tree(null, "e", new Tree[] { }),
581 new Tree(null, "n", new Tree[] { }),
582 new Tree(null, "c", new Tree[] { }),
583 new Tree(null, "e", new Tree[] { })})})})}),
584 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
585 new Tree(null, "e", new Tree[] { }),
586 new Tree(null, "w", new Tree[] { }),
587 new Tree(null, "r", new Tree[] { }),
588 new Tree(null, "i", new Tree[] { }),
589 new Tree(null, "t", new Tree[] { }),
590 new Tree(null, "e", new Tree[] { })})})}),
591 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, "S", new Tree[] { }),
592 new Tree(null, "e", new Tree[] { }),
593 new Tree(null, "q", new Tree[] { }),
594 new Tree(null, "u", new Tree[] { }),
595 new Tree(null, "e", new Tree[] { }),
596 new Tree(null, "n", new Tree[] { }),
597 new Tree(null, "c", new Tree[] { }),
598 new Tree(null, "e", new Tree[] { })})})}),
599 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=", new Tree[] { }),
600 new Tree(null, ">", new Tree[] { })})})}),
601 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
602 new Tree(null, "o", new Tree[] { }),
603 new Tree(null, "r", new Tree[] { }),
604 new Tree(null, "d", new Tree[] { })})})})})}),
605 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, "S", new Tree[] { }),
606 new Tree(null, "e", new Tree[] { }),
607 new Tree(null, "q", new Tree[] { }),
608 new Tree(null, "u", new Tree[] { }),
609 new Tree(null, "e", new Tree[] { }),
610 new Tree(null, "n", new Tree[] { }),
611 new Tree(null, "c", new Tree[] { }),
612 new Tree(null, "e", new Tree[] { })})})}),
613 new Tree(null, "care", 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[] { })})})}),
615 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
616 new Tree(null, "u", new Tree[] { }),
617 new Tree(null, "o", new Tree[] { }),
618 new Tree(null, "t", new Tree[] { }),
619 new Tree(null, "e", new Tree[] { }),
620 new Tree(null, "d", new Tree[] { })})})})})}),
621 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, "S", new Tree[] { }),
622 new Tree(null, "e", new Tree[] { }),
623 new Tree(null, "q", new Tree[] { }),
624 new Tree(null, "u", new Tree[] { }),
625 new Tree(null, "e", new Tree[] { }),
626 new Tree(null, "n", new Tree[] { }),
627 new Tree(null, "c", new Tree[] { }),
628 new Tree(null, "e", new Tree[] { })})})}),
629 new Tree(null, "literal", 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, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { }),
632 new Tree(null, ")", new Tree[] { })})})})}),
633 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
634 new Tree(null, "r", new Tree[] { }),
635 new Tree(null, "a", new Tree[] { }),
636 new Tree(null, "p", new Tree[] { })})})})})})})}),
637 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
638 new Tree(null, "a", new Tree[] { }),
639 new Tree(null, "n", new Tree[] { }),
640 new Tree(null, "g", new Tree[] { }),
641 new Tree(null, "e", new Tree[] { })})}),
642 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[] { }),
643 new Tree(null, "c", new Tree[] { })})})})}),
644 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
645 new Tree(null, "a", new Tree[] { }),
646 new Tree(null, "n", new Tree[] { }),
647 new Tree(null, "g", new Tree[] { }),
648 new Tree(null, "e", new Tree[] { }),
649 new Tree(null, "0", new Tree[] { })})})}),
650 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[] { }),
651 new Tree(null, "c", new Tree[] { })})})}),
652 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "-", new Tree[] { })})})}),
653 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
654 new Tree(null, "c", new Tree[] { })})})})}),
655 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
656 new Tree(null, "a", new Tree[] { }),
657 new Tree(null, "n", new Tree[] { }),
658 new Tree(null, "g", new Tree[] { }),
659 new Tree(null, "e", new Tree[] { }),
660 new Tree(null, "0", new Tree[] { })})})})})})})}),
661 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})}),
662 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[] { }),
663 new Tree(null, "o", new Tree[] { }),
664 new Tree(null, "r", new Tree[] { }),
665 new Tree(null, "d", new Tree[] { })})})})}),
666 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "n", new Tree[] { }),
667 new Tree(null, "o", new Tree[] { }),
668 new Tree(null, "n", new Tree[] { }),
669 new Tree(null, "T", new Tree[] { }),
670 new Tree(null, "e", new Tree[] { }),
671 new Tree(null, "r", new Tree[] { }),
672 new Tree(null, "m", new Tree[] { }),
673 new Tree(null, "i", new Tree[] { }),
674 new Tree(null, "n", new Tree[] { }),
675 new Tree(null, "a", new Tree[] { }),
676 new Tree(null, "l", new Tree[] { }),
677 new Tree(null, "Y", new Tree[] { })})})}),
678 new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, null, new Tree[] { }),
679 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "(", new Tree[] { })})})}),
680 new Tree(null, "range", new Tree[] { new Tree(null, null, new Tree[] { }),
681 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, ")", new Tree[] { })})})})}),
682 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
683 new Tree(null, "p", new Tree[] { }),
684 new Tree(null, "s", new Tree[] { }),
685 new Tree(null, "i", new Tree[] { }),
686 new Tree(null, "l", new Tree[] { }),
687 new Tree(null, "o", new Tree[] { }),
688 new Tree(null, "n", new Tree[] { })})})}),
689 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[] { })})})}),
690 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "A", new Tree[] { }),
691 new Tree(null, "l", new Tree[] { }),
692 new Tree(null, "t", new Tree[] { }),
693 new Tree(null, "e", new Tree[] { }),
694 new Tree(null, "r", new Tree[] { }),
695 new Tree(null, "n", new Tree[] { }),
696 new Tree(null, "a", new Tree[] { }),
697 new Tree(null, "t", new Tree[] { }),
698 new Tree(null, "i", new Tree[] { }),
699 new Tree(null, "v", new Tree[] { }),
700 new Tree(null, "e", new Tree[] { }),
701 new Tree(null, "s", new Tree[] { })})})}),
702 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[] { 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[] { })})})}),
704 new Tree(null, "?", new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, null, new Tree[] { }),
705 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "~", new Tree[] { })})})})}),
706 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[] { }),
707 new Tree(null, "a", new Tree[] { }),
708 new Tree(null, "n", new Tree[] { }),
709 new Tree(null, "g", new Tree[] { }),
710 new Tree(null, "e", new Tree[] { })})})})}),
711 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "]", new Tree[] { })})})})}),
712 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
713 new Tree(null, "a", new Tree[] { }),
714 new Tree(null, "n", new Tree[] { }),
715 new Tree(null, "g", new Tree[] { }),
716 new Tree(null, "e", new Tree[] { })})})}),
717 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[] { })})})}),
718 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { }),
719 new Tree(null, "/", new Tree[] { })})})}),
720 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
721 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[] { })})})}),
722 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { }),
723 new Tree(null, "/", new Tree[] { })})})}),
724 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
725 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[] { })})})}),
726 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "?", new Tree[] { })})})})})}),
727 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[] { })})})}),
728 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "~", new Tree[] { }),
729 new Tree(null, "/", new Tree[] { }),
730 new Tree(null, "~", new Tree[] { })})})})})}),
731 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[] { })})})}),
732 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "-", new Tree[] { })})})}),
733 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
734 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[] { })})})}),
735 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
736 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[] { })})})}),
737 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
738 new Tree(null, "u", new Tree[] { }),
739 new Tree(null, "o", new Tree[] { }),
740 new Tree(null, "t", new Tree[] { }),
741 new Tree(null, "e", new Tree[] { }),
742 new Tree(null, "d", new Tree[] { })})})})}),
743 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "c", new Tree[] { }),
744 new Tree(null, "a", new Tree[] { }),
745 new Tree(null, "r", new Tree[] { }),
746 new Tree(null, "e", new Tree[] { })})})}),
747 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[] { })})})}),
748 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { })})})})})}),
749 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[] { })})})}),
750 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "#", new Tree[] { })})})})})}),
751 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[] { }),
752 new Tree(null, "u", new Tree[] { }),
753 new Tree(null, "o", new Tree[] { }),
754 new Tree(null, "t", new Tree[] { }),
755 new Tree(null, "e", new Tree[] { }),
756 new Tree(null, "d", new Tree[] { })})})})}),
757 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "l", new Tree[] { }),
758 new Tree(null, "i", new Tree[] { }),
759 new Tree(null, "t", new Tree[] { }),
760 new Tree(null, "e", new Tree[] { }),
761 new Tree(null, "r", new Tree[] { }),
762 new Tree(null, "a", new Tree[] { }),
763 new Tree(null, "l", new Tree[] { })})})}),
764 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[] { })})})}),
765 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { }),
766 new Tree(null, "*", new Tree[] { })})})})})})})}),
767 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[] { })})})}),
768 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { })})})})})})})})})})})}),
769 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[] { })})})}),
770 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { }),
771 new Tree(null, "+", new Tree[] { })})})})})})})}),
772 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[] { })})})}),
773 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { })})})})})})})})})})})}),
774 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[] { })})})}),
775 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
776 new Tree(null, "o", new Tree[] { }),
777 new Tree(null, "r", new Tree[] { }),
778 new Tree(null, "d", new Tree[] { })})})}),
779 new Tree(null, "care", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ")", new Tree[] { })})})})})})})}),
780 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[] { })})})}),
781 new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "A", new Tree[] { }),
782 new Tree(null, "l", new Tree[] { }),
783 new Tree(null, "t", new Tree[] { }),
784 new Tree(null, "e", new Tree[] { }),
785 new Tree(null, "r", new Tree[] { }),
786 new Tree(null, "n", new Tree[] { }),
787 new Tree(null, "a", new Tree[] { }),
788 new Tree(null, "t", new Tree[] { }),
789 new Tree(null, "i", new Tree[] { }),
790 new Tree(null, "v", new Tree[] { }),
791 new Tree(null, "e", new Tree[] { }),
792 new Tree(null, "s", new Tree[] { })})})}),
793 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ")", new Tree[] { })})})})})})})})})}),
794 new Tree(null, "!::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { })})}),
795 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[] { })})})})})}),
796 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[] { }),
797 new Tree(null, "/", new Tree[] { })})})}),
798 new Tree(null, "*", new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, "~", new Tree[] { }),
799 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "\n", new Tree[] { })})})})}),
800 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\n", new Tree[] { })})})})})}),
801 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[] { })})})})})}),
802 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[] { })})})})})})})})})}),
803 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "a", new Tree[] { }),
804 new Tree(null, "n", new Tree[] { })})}),
805 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[] { }),
806 new Tree(null, null, new Tree[] { new Tree(null, "-", new Tree[] { new Tree(null, "a", new Tree[] { }),
807 new Tree(null, "z", new Tree[] { })}),
808 new Tree(null, "-", new Tree[] { new Tree(null, "A", new Tree[] { }),
809 new Tree(null, "Z", new Tree[] { })}),
810 new Tree(null, "-", new Tree[] { new Tree(null, "0", new Tree[] { }),
811 new Tree(null, "9", new Tree[] { })}),
812 new Tree(null, "range0", new Tree[] { new Tree(null, "_", new Tree[] { })})})})})})})})})}),
813 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
814 new Tree(null, "o", new Tree[] { }),
815 new Tree(null, "r", new Tree[] { }),
816 new Tree(null, "d", new Tree[] { })})}),
817 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[] { }),
818 new Tree(null, "n", new Tree[] { })})})})})}),
819 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { }),
820 new Tree(null, "i", new Tree[] { }),
821 new Tree(null, "f", new Tree[] { }),
822 new Tree(null, "y", new Tree[] { })})})})})})})}),
823 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
824 new Tree(null, "u", new Tree[] { }),
825 new Tree(null, "o", new Tree[] { }),
826 new Tree(null, "t", new Tree[] { }),
827 new Tree(null, "e", new Tree[] { }),
828 new Tree(null, "d", new Tree[] { })})}),
829 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[] { })})})}),
830 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[] { }),
831 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "\"", new Tree[] { })}),
832 new Tree(null, "range0", new Tree[] { new Tree(null, "\\", new Tree[] { })})})})})}),
833 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[] { }),
834 new Tree(null, "s", new Tree[] { }),
835 new Tree(null, "c", new Tree[] { }),
836 new Tree(null, "a", new Tree[] { }),
837 new Tree(null, "p", new Tree[] { }),
838 new Tree(null, "e", new Tree[] { }),
839 new Tree(null, "d", new Tree[] { })})})})})})})})})})}),
840 new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\"", new Tree[] { })})})})}),
841 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { }),
842 new Tree(null, "i", new Tree[] { }),
843 new Tree(null, "f", new Tree[] { }),
844 new Tree(null, "y", new Tree[] { })})})})})})})}),
845 new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
846 new Tree(null, "s", new Tree[] { }),
847 new Tree(null, "c", new Tree[] { }),
848 new Tree(null, "a", new Tree[] { }),
849 new Tree(null, "p", new Tree[] { }),
850 new Tree(null, "e", new Tree[] { }),
851 new Tree(null, "d", new Tree[] { })})}),
852 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[] { }),
853 new Tree(null, "n", new Tree[] { })})})})}),
854 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\n", new Tree[] { })})})}),
855 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[] { }),
856 new Tree(null, "r", new Tree[] { })})})})}),
857 new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\r", new Tree[] { })})})}),
858 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[] { })})})}),
859 new Tree(null, "range", new Tree[] { new Tree(null, "~", new Tree[] { }),
860 new Tree(null, null, new Tree[] { new Tree(null, "range0", new Tree[] { new Tree(null, "n", new Tree[] { })}),
861 new Tree(null, "range0", new Tree[] { new Tree(null, "r", new Tree[] { })})})})})})})})})})})}),
862 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { })})})
863 // DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED