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();
12 public String toString() {
13 StringBuffer ret = new StringBuffer();
14 for(Union u : nt.values()) u.toString(ret);
15 return ret.toString();
18 private static HashSet<Element> dropAll = new HashSet<Element>();
20 // Statics //////////////////////////////////////////////////////////////////////////////
22 private static final Union SELF = new Union("()");
24 ////////////////////////////////////////////////////////////////////////////////
27 private HashMap<String,Union> nt;
29 private String startSymbol;
30 private boolean strings;
32 private Element set(Range.Set r) { if (strings) throw new Error(); return CharToken.set(r); }
33 private Element string(String s) { return strings ? StringToken.string(s) : CharToken.string(s); }
34 private Atom leftBrace() { return strings ? StringToken.leftBrace : CharToken.leftBrace; }
35 private Atom rightBrace() { return strings ? StringToken.rightBrace : CharToken.rightBrace; }
37 public MetaGrammar() { this("s", false); }
38 public MetaGrammar(String s) { this(s, false); }
39 public MetaGrammar(String s, boolean strings) { this.strings = strings; done(s); }
40 public Union done() { return done("s"); }
41 public Union done(String str) {
45 nt = new HashMap<String,Union>();
46 dropAll = new HashSet<Element>();
52 // MetaGrammar //////////////////////////////////////////////////////////////////////////////
54 public Union nonTerminal(String str, PreSequence[][] s, boolean synthetic, boolean dropAll) {
55 Union n = str.equals(startSymbol) ? g : nt.get(str);
56 if (n == null) nt.put(str, n = new Union(str, synthetic));
57 if (dropAll) this.dropAll.add(n);
58 if (s==null) return n;
59 HashSet<Sequence> seqs = new HashSet<Sequence>();
60 for(int i=0; i<s.length; i++) {
61 if (s[i]==null) continue;
62 HashSet<Sequence> temp = new HashSet<Sequence>();
63 for(PreSequence pre : s[i]) {
65 Sequence seq = pre.buildSequence(n, false, dropAll);
74 public String string(Tree<String> tree) {
76 if (tree.head()!=null) ret += tree.head();
77 for(Tree<String> t : tree.children()) ret += string(t);
81 public Object walk(Tree<String> tree) {
82 String head = tree.head();
83 if (tree.numChildren()==0) return super.walk(tree);
84 if ("\\n".equals(head)) return new Character('\n');
85 else if ("\\r".equals(head)) return new Character('\r');
86 else if ("grammar".equals(head)) { for(Tree<String> t : tree.children()) walk(t); return this; }
87 else if ("*".equals(head)) return Repeat.many0((Element)walk(tree.child(0)));
88 else if ("+".equals(head)) return Repeat.many1((Element)walk(tree.child(0)));
89 else if ("+/".equals(head)) return Repeat.many1((Element)walk(tree.child(0)), (Element)walk(tree.child(1)));
90 else if ("*/".equals(head)) return Repeat.many0((Element)walk(tree.child(0)), (Element)walk(tree.child(1)));
91 else if ("**".equals(head)) return Repeat.maximal(Repeat.many0((Element)walk(tree.child(0))));
92 else if ("++".equals(head)) return Repeat.maximal(Repeat.many1((Element)walk(tree.child(0))));
93 else if ("?".equals(head)) return Repeat.maybe((Element)walk(tree.child(0)));
94 else if ("&".equals(head))
95 return ((PreSequence)walk(tree,0)).and(new PreSequence((Element[])Reflection.lub((Object[])walk(tree, 1)), null).buildSequence(null, true, false));
96 else if ("&~".equals(head))
97 return ((PreSequence)walk(tree,0)).not(new PreSequence((Element[])Reflection.lub((Object[])walk(tree, 1)), null).buildSequence(null, true, false));
98 else if ("epsilon".equals(head)) return Union.epsilon;
99 else if ("()".equals(head)) return Union.epsilon;
100 else if (")".equals(head)) return SELF;
101 else if ("nonTerminal".equals(head)) return nonTerminal(string(tree.child(0)), null, false, false);
102 else if ("::=".equals(head)) return nonTerminal(string(tree.child(0)), (PreSequence[][])walk(tree, 1), false, false);
103 else if ("!::=".equals(head)) return nonTerminal(string(tree.child(0)), (PreSequence[][])walk(tree, 1), false, true);
104 else if ("(".equals(head)) return nonTerminal("anon"+(anon++), (PreSequence[][])walk(tree, 0), false, false);
105 else if ("literal".equals(head)) { Element ret = string(string(tree.child(0))); dropAll.add(ret); return ret; }
106 else if ("-".equals(head)) return new Range(walk(tree, 0).toString().charAt(0), walk(tree,1).toString().charAt(0));
107 else if ("range".equals(head)) return new Range(walk(tree, 0).toString().charAt(0), walk(tree,0).toString().charAt(0));
108 else if ("gram".equals(head)) return walk(tree, 1);
109 else if ("=>".equals(head)) { PreSequence p = (PreSequence)walk(tree, 0); p.tag = string(tree.child(1)); return p; }
110 else if ("/".equals(head)) return ((PreSequence)walk(tree, 0)).sparse((Element)walk(tree, 1));
111 else if ("ps".equals(head)) return new PreSequence((Element[])walk(tree, 0));
112 else if ("ps2".equals(head)) {
113 Object[] o1 = (Object[])walk(tree, 0);
114 String s = string(tree.child(1));
115 Object[] o2 = (Object[])walk(tree, 2);
116 if (o1==null) o1 = new Object[0];
117 if (o2==null) o2 = new Object[0];
118 Object[] o3 = new Object[o1.length + o2.length + 1];
119 System.arraycopy(o1, 0, o3, 0, o1.length);
120 o3[o1.length] = string(s);
121 System.arraycopy(o2, 0, o3, o1.length+1, o2.length);
122 PreSequence ret = new PreSequence(o3, s);
123 ret.drops[o1.length] = o3.length>1;
125 } else if ("{".equals(head))
126 return nonTerminal("braced"+(anon++),
127 new PreSequence[][] {
129 new PreSequence(new Element[] { leftBrace(),
130 ((PreSequence)walk(tree, 0)).buildUnion(),
137 else if ("[".equals(head) || "[~".equals(head)) {
138 boolean positive = "[".equals(head);
139 Range[] rr = (Range[])walk(tree, 0);
140 Range.Set ret = positive ? new Range.Set() : new Range.Set(new Range(true, true));
143 if (positive) ret.add(r);
147 else return super.walk(tree);
151 //////////////////////////////////////////////////////////////////////////////
153 public class PreSequence {
154 public final HashSet<Sequence> and = new HashSet<Sequence>();
155 public final HashSet<Sequence> not = new HashSet<Sequence>();
156 public /*final*/ String tag;
157 public final Object[] o;
159 public PreSequence sparse(Object e) {
164 drops = new boolean[this.drops.length];
165 System.arraycopy(this.drops, 0, drops, 0, this.drops.length);
167 ret = new Object[o.length * 2 - 1];
168 drops = new boolean[o.length * 2 - 1];
169 for(int i=0; i<o.length; i++) {
172 drops[i*2] = this.drops[i];
173 if (i*2+1<ret.length) {
179 PreSequence p = new PreSequence(ret, tag, drops);
185 public PreSequence not(Sequence s) { not.add(s); return this; }
186 public PreSequence and(Sequence s) { and.add(s); return this; }
188 boolean[] drops = null;
189 public PreSequence(Object o) { this(new Object[] { o }, null); }
190 public PreSequence(Object[] o) { this(o, null); }
191 public PreSequence(Object[] o, String tag) { this(o, tag, null); }
192 public PreSequence(Object[] o, String tag, boolean[] drops) {
195 this.drops = drops==null ? new boolean[o.length] : drops;
198 public Union buildUnion() {
199 Union u = new Union("???");
200 u.add(buildSequence(u));
203 public Sequence buildSequence(Union u) { return buildSequence(u, false, false); }
204 public Sequence buildSequence(Union u, boolean lame, boolean dropAll) {
205 for(Sequence s : and) u.add(s);
206 for(Sequence s : not) u.add(s);
207 HashSet<Sequence> set = new HashSet<Sequence>();
208 Element[] o2 = o==null ? new Element[0] : new Element[o.length];
212 for(int i=0; i<o.length; i++) {
214 if (oi==SELF) o2[j] = u.new Subset("(("+u+"))", set);
215 else o2[j] = (Element)oi;
217 if (MetaGrammar.dropAll.contains(o2[j])) drops[j] = true;
218 nonDrop += drops[j] ? 0 : 1;
223 Element[] expansion = o2;
225 if (dropAll || lame) ret = Sequence.drop(expansion, and, not, lame);
226 else if (tag!=null) ret = Sequence.rewritingSequence(tag, expansion, drops, and, not);
229 for(int i=0; i<expansion.length; i++) {
230 if (!drops[i]) idx = i;
231 else expansion[i] = expansion[i];
233 ret = idx==-1 ? Sequence.drop(expansion, and, not, false) : Sequence.singleton(expansion, idx, and, not);
240 public static void main(String[] args) throws Exception {
241 if (args.length != 2) {
242 System.err.println("usage: java " + MetaGrammar.class.getName() + " grammarfile.g com.yourdomain.package.ClassName");
246 String className = args[1].substring(args[1].lastIndexOf('.')+1);
247 String packageName = args[1].substring(0, args[1].lastIndexOf('.'));
248 String fileName = packageName.replace('.', '/') + "/" + className + ".java";
250 BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(fileName)));
251 StringBuffer out = new StringBuffer();
253 boolean skip = false;
254 for(String s = br.readLine(); s != null; s = br.readLine()) {
255 if (s.indexOf("DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED") != -1 && s.indexOf("\"")==-1) skip = true;
256 if (s.indexOf("DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED") != -1 && s.indexOf("\"")==-1) break;
257 if (!skip) out.append(s+"\n");
260 out.append("\n // DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED\n");
261 new Parser(MetaGrammar.make(), CharToken.top()).parse1(new CharToken.Stream(new InputStreamReader(new FileInputStream(args[0])))).toJava(out);
262 out.append("\n // DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED\n");
264 for(String s = br.readLine(); s != null; s = br.readLine()) out.append(s+"\n");
267 OutputStream os = new FileOutputStream(fileName);
268 PrintWriter p = new PrintWriter(new OutputStreamWriter(os));
269 p.println(out.toString());
274 public static final Tree meta =
289 // DO NOT EDIT STUFF BELOW: IT IS AUTOMATICALLY GENERATED
290 new Tree(null, "gram", new Tree[] { new Tree(null, null, new Tree[] { }),
291 new Tree(null, "grammar", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { })}),
292 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
293 new Tree(null, "s", new Tree[] { })})}),
294 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
295 new Tree(null, "r", new Tree[] { }),
296 new Tree(null, "a", new Tree[] { }),
297 new Tree(null, "m", new Tree[] { }),
298 new Tree(null, "m", new Tree[] { }),
299 new Tree(null, "a", new Tree[] { }),
300 new Tree(null, "r", new Tree[] { })})}),
301 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
302 new Tree(null, "s", new Tree[] { })})})})}),
303 new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
304 new Tree(null, "r", new Tree[] { }),
305 new Tree(null, "a", new Tree[] { }),
306 new Tree(null, "m", new Tree[] { })})})})})}),
307 new Tree(null, "!::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
308 new Tree(null, "s", new Tree[] { })}),
309 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "**", new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { })})})})})})})})}),
310 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
311 new Tree(null, "r", new Tree[] { }),
312 new Tree(null, "a", new Tree[] { }),
313 new Tree(null, "m", new Tree[] { }),
314 new Tree(null, "m", new Tree[] { }),
315 new Tree(null, "a", new Tree[] { }),
316 new Tree(null, "r", new Tree[] { })}),
317 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { })})}),
318 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
319 new Tree(null, "s", new Tree[] { })})})})})}),
320 new Tree(null, null, new Tree[] { new Tree(null, "g", new Tree[] { }),
321 new Tree(null, "r", new Tree[] { }),
322 new Tree(null, "a", new Tree[] { }),
323 new Tree(null, "m", new Tree[] { }),
324 new Tree(null, "m", new Tree[] { }),
325 new Tree(null, "a", new Tree[] { }),
326 new Tree(null, "r", new Tree[] { })})})})})}),
327 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { })}),
328 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
329 new Tree(null, "o", new Tree[] { }),
330 new Tree(null, "r", new Tree[] { }),
331 new Tree(null, "d", new Tree[] { })})})}),
332 new Tree(null, null, new Tree[] { new Tree(null, ":", new Tree[] { }),
333 new Tree(null, ":", new Tree[] { }),
334 new Tree(null, "=", new Tree[] { })}),
335 new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "a", new Tree[] { }),
336 new Tree(null, "l", new Tree[] { }),
337 new Tree(null, "t", new Tree[] { }),
338 new Tree(null, "e", new Tree[] { }),
339 new Tree(null, "r", new Tree[] { }),
340 new Tree(null, "n", new Tree[] { }),
341 new Tree(null, "a", new Tree[] { }),
342 new Tree(null, "t", new Tree[] { }),
343 new Tree(null, "i", new Tree[] { }),
344 new Tree(null, "v", new Tree[] { }),
345 new Tree(null, "e", new Tree[] { }),
346 new Tree(null, "s", new Tree[] { })})})})}),
347 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
348 new Tree(null, "s", new Tree[] { })})})}),
349 new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
350 new Tree(null, "o", new Tree[] { }),
351 new Tree(null, "r", new Tree[] { }),
352 new Tree(null, "d", new Tree[] { })})})}),
353 new Tree(null, null, new Tree[] { new Tree(null, "!", new Tree[] { }),
354 new Tree(null, ":", new Tree[] { }),
355 new Tree(null, ":", new Tree[] { }),
356 new Tree(null, "=", new Tree[] { })}),
357 new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "a", new Tree[] { }),
358 new Tree(null, "l", new Tree[] { }),
359 new Tree(null, "t", new Tree[] { }),
360 new Tree(null, "e", new Tree[] { }),
361 new Tree(null, "r", new Tree[] { }),
362 new Tree(null, "n", new Tree[] { }),
363 new Tree(null, "a", new Tree[] { }),
364 new Tree(null, "t", new Tree[] { }),
365 new Tree(null, "i", new Tree[] { }),
366 new Tree(null, "v", new Tree[] { }),
367 new Tree(null, "e", new Tree[] { }),
368 new Tree(null, "s", new Tree[] { })})})})}),
369 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
370 new Tree(null, "s", new Tree[] { })})})})})})}),
371 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "a", new Tree[] { }),
372 new Tree(null, "l", new Tree[] { }),
373 new Tree(null, "t", new Tree[] { }),
374 new Tree(null, "e", new Tree[] { }),
375 new Tree(null, "r", new Tree[] { }),
376 new Tree(null, "n", new Tree[] { }),
377 new Tree(null, "a", new Tree[] { }),
378 new Tree(null, "t", new Tree[] { }),
379 new Tree(null, "i", new Tree[] { }),
380 new Tree(null, "v", new Tree[] { }),
381 new Tree(null, "e", new Tree[] { }),
382 new Tree(null, "s", new Tree[] { })}),
383 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+/", new Tree[] { new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "c", new Tree[] { }),
384 new Tree(null, "o", new Tree[] { }),
385 new Tree(null, "n", new Tree[] { }),
386 new Tree(null, "j", new Tree[] { }),
387 new Tree(null, "u", new Tree[] { }),
388 new Tree(null, "n", new Tree[] { }),
389 new Tree(null, "c", new Tree[] { }),
390 new Tree(null, "t", new Tree[] { }),
391 new Tree(null, "s", new Tree[] { })})}),
392 new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
393 new Tree(null, "s", new Tree[] { })})}),
394 new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "|", new Tree[] { })})}),
395 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
396 new Tree(null, "s", new Tree[] { })})})})})})})})})})})})})}),
397 new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
398 new Tree(null, "s", new Tree[] { })})}),
399 new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ">", new Tree[] { })})}),
400 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
401 new Tree(null, "s", new Tree[] { })})})})})})})})})})})})})}),
402 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "c", new Tree[] { }),
403 new Tree(null, "o", new Tree[] { }),
404 new Tree(null, "n", new Tree[] { }),
405 new Tree(null, "j", new Tree[] { }),
406 new Tree(null, "u", new Tree[] { }),
407 new Tree(null, "n", new Tree[] { }),
408 new Tree(null, "c", new Tree[] { }),
409 new Tree(null, "t", new Tree[] { }),
410 new Tree(null, "s", new Tree[] { })}),
411 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { }),
412 new Tree(null, "e", new Tree[] { }),
413 new Tree(null, "q", new Tree[] { }),
414 new Tree(null, "u", new Tree[] { }),
415 new Tree(null, "e", new Tree[] { }),
416 new Tree(null, "n", new Tree[] { }),
417 new Tree(null, "c", new Tree[] { }),
418 new Tree(null, "e", new Tree[] { })})})})}),
419 new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { }),
420 new Tree(null, "e", new Tree[] { }),
421 new Tree(null, "q", new Tree[] { }),
422 new Tree(null, "u", new Tree[] { }),
423 new Tree(null, "e", new Tree[] { }),
424 new Tree(null, "n", new Tree[] { }),
425 new Tree(null, "c", new Tree[] { }),
426 new Tree(null, "e", new Tree[] { })})})}),
427 new Tree(null, null, new Tree[] { new Tree(null, "&", new Tree[] { })}),
428 new Tree(null, null, new Tree[] { new Tree(null, "*/", new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})}),
429 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
430 new Tree(null, "s", new Tree[] { })})})})})}),
431 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
432 new Tree(null, "s", new Tree[] { })})})}),
433 new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { }),
434 new Tree(null, "e", new Tree[] { }),
435 new Tree(null, "q", new Tree[] { }),
436 new Tree(null, "u", new Tree[] { }),
437 new Tree(null, "e", new Tree[] { }),
438 new Tree(null, "n", new Tree[] { }),
439 new Tree(null, "c", new Tree[] { }),
440 new Tree(null, "e", new Tree[] { })})})}),
441 new Tree(null, null, new Tree[] { new Tree(null, "&", new Tree[] { }),
442 new Tree(null, "~", new Tree[] { })}),
443 new Tree(null, null, new Tree[] { new Tree(null, "*/", new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})}),
444 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
445 new Tree(null, "s", new Tree[] { })})})})})}),
446 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
447 new Tree(null, "s", new Tree[] { })})})})})})}),
448 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "p", new Tree[] { }),
449 new Tree(null, "s", new Tree[] { })}),
450 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "*/", new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})}),
451 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
452 new Tree(null, "s", new Tree[] { })})})})})}),
453 new Tree(null, null, new Tree[] { new Tree(null, "p", new Tree[] { }),
454 new Tree(null, "s", new Tree[] { })})}),
455 new Tree(null, "=>", new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "?", new Tree[] { new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})}),
456 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
457 new Tree(null, "s", new Tree[] { })})})}),
458 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
459 new Tree(null, "s", new Tree[] { })})})})})})})})}),
460 new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "^", new Tree[] { })})}),
461 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
462 new Tree(null, "u", new Tree[] { }),
463 new Tree(null, "o", new Tree[] { }),
464 new Tree(null, "t", new Tree[] { }),
465 new Tree(null, "e", new Tree[] { }),
466 new Tree(null, "d", new Tree[] { })})}),
467 new Tree(null, "?", new Tree[] { new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
468 new Tree(null, "s", new Tree[] { })})}),
469 new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})}),
470 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
471 new Tree(null, "s", new Tree[] { })})})})})})})})})})})}),
472 new Tree(null, null, new Tree[] { new Tree(null, "p", new Tree[] { }),
473 new Tree(null, "s", new Tree[] { }),
474 new Tree(null, "2", new Tree[] { })})})})})}),
475 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "p", new Tree[] { }),
476 new Tree(null, "s", new Tree[] { }),
477 new Tree(null, "x", new Tree[] { })}),
478 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "p", new Tree[] { }),
479 new Tree(null, "s", new Tree[] { })})})})})}),
480 new Tree(null, null, new Tree[] { new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "p", new Tree[] { }),
481 new Tree(null, "s", new Tree[] { })})})}),
482 new Tree(null, null, new Tree[] { new Tree(null, "/", new Tree[] { })}),
483 new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})})})}),
484 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
485 new Tree(null, "s", new Tree[] { })})})})})})}),
486 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { }),
487 new Tree(null, "e", new Tree[] { }),
488 new Tree(null, "q", new Tree[] { }),
489 new Tree(null, "u", new Tree[] { }),
490 new Tree(null, "e", new Tree[] { }),
491 new Tree(null, "n", new Tree[] { }),
492 new Tree(null, "c", new Tree[] { }),
493 new Tree(null, "e", new Tree[] { })}),
494 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "p", new Tree[] { }),
495 new Tree(null, "s", new Tree[] { }),
496 new Tree(null, "x", new Tree[] { })})})})}),
497 new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "p", new Tree[] { }),
498 new Tree(null, "s", new Tree[] { }),
499 new Tree(null, "x", new Tree[] { })})})}),
500 new Tree(null, null, new Tree[] { new Tree(null, "=", new Tree[] { }),
501 new Tree(null, ">", new Tree[] { })}),
502 new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
503 new Tree(null, "o", new Tree[] { }),
504 new Tree(null, "r", new Tree[] { }),
505 new Tree(null, "d", new Tree[] { })})})})}),
506 new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
507 new Tree(null, "u", new Tree[] { }),
508 new Tree(null, "o", new Tree[] { }),
509 new Tree(null, "t", new Tree[] { }),
510 new Tree(null, "e", new Tree[] { }),
511 new Tree(null, "d", new Tree[] { })})})})})})})})})}),
512 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
513 new Tree(null, "s", new Tree[] { })})})})})})}),
514 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
515 new Tree(null, "c", new Tree[] { })}),
516 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "[~", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, "-", new Tree[] { })}),
517 new Tree(null, "range", new Tree[] { new Tree(null, "]", new Tree[] { })}),
518 new Tree(null, "range", new Tree[] { new Tree(null, "\\", new Tree[] { })}),
519 new Tree(null, "range", new Tree[] { new Tree(null, "~", new Tree[] { })})})})})}),
520 new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
521 new Tree(null, "s", new Tree[] { }),
522 new Tree(null, "c", new Tree[] { }),
523 new Tree(null, "a", new Tree[] { }),
524 new Tree(null, "p", new Tree[] { }),
525 new Tree(null, "e", new Tree[] { }),
526 new Tree(null, "d", new Tree[] { })})})})})})})}),
527 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
528 new Tree(null, "a", new Tree[] { }),
529 new Tree(null, "n", new Tree[] { }),
530 new Tree(null, "g", new Tree[] { }),
531 new Tree(null, "e", new Tree[] { })}),
532 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
533 new Tree(null, "c", new Tree[] { })})})})}),
534 new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
535 new Tree(null, "a", new Tree[] { }),
536 new Tree(null, "n", new Tree[] { }),
537 new Tree(null, "g", new Tree[] { }),
538 new Tree(null, "e", new Tree[] { })})}),
539 new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
540 new Tree(null, "c", new Tree[] { })})})}),
541 new Tree(null, null, new Tree[] { new Tree(null, "-", new Tree[] { })}),
542 new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
543 new Tree(null, "c", new Tree[] { })})})})})})})}),
544 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })}),
545 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
546 new Tree(null, "o", new Tree[] { }),
547 new Tree(null, "r", new Tree[] { }),
548 new Tree(null, "d", new Tree[] { })})})})}),
549 new Tree(null, null, new Tree[] { new Tree(null, "n", new Tree[] { }),
550 new Tree(null, "o", new Tree[] { }),
551 new Tree(null, "n", new Tree[] { }),
552 new Tree(null, "T", new Tree[] { }),
553 new Tree(null, "e", new Tree[] { }),
554 new Tree(null, "r", new Tree[] { }),
555 new Tree(null, "m", new Tree[] { }),
556 new Tree(null, "i", new Tree[] { }),
557 new Tree(null, "n", new Tree[] { }),
558 new Tree(null, "a", new Tree[] { }),
559 new Tree(null, "l", new Tree[] { })})}),
560 new Tree(null, "=>", new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
561 new Tree(null, "u", new Tree[] { }),
562 new Tree(null, "o", new Tree[] { }),
563 new Tree(null, "t", new Tree[] { }),
564 new Tree(null, "e", new Tree[] { }),
565 new Tree(null, "d", new Tree[] { })})})})}),
566 new Tree(null, null, new Tree[] { new Tree(null, "l", new Tree[] { }),
567 new Tree(null, "i", new Tree[] { }),
568 new Tree(null, "t", new Tree[] { }),
569 new Tree(null, "e", new Tree[] { }),
570 new Tree(null, "r", new Tree[] { }),
571 new Tree(null, "a", new Tree[] { }),
572 new Tree(null, "l", new Tree[] { })})}),
573 new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { }),
574 new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { }),
575 new Tree(null, ")", new Tree[] { })}),
576 new Tree(null, null, new Tree[] { })}),
577 new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { }),
578 new Tree(null, null, new Tree[] { new Tree(null, "{", new Tree[] { })}),
579 new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "s", new Tree[] { }),
580 new Tree(null, "e", new Tree[] { }),
581 new Tree(null, "q", new Tree[] { }),
582 new Tree(null, "u", new Tree[] { }),
583 new Tree(null, "e", new Tree[] { }),
584 new Tree(null, "n", new Tree[] { }),
585 new Tree(null, "c", new Tree[] { }),
586 new Tree(null, "e", new Tree[] { })})}),
587 new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "}", new Tree[] { })})})})}),
588 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
589 new Tree(null, "s", new Tree[] { })})})}),
590 new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { }),
591 new Tree(null, null, new Tree[] { new Tree(null, "[", new Tree[] { })}),
592 new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
593 new Tree(null, "a", new Tree[] { }),
594 new Tree(null, "n", new Tree[] { }),
595 new Tree(null, "g", new Tree[] { }),
596 new Tree(null, "e", new Tree[] { })})})}),
597 new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "]", new Tree[] { })})})})}),
598 new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { }),
599 new Tree(null, null, new Tree[] { new Tree(null, "[", new Tree[] { }),
600 new Tree(null, "~", new Tree[] { })}),
601 new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "r", new Tree[] { }),
602 new Tree(null, "a", new Tree[] { }),
603 new Tree(null, "n", new Tree[] { }),
604 new Tree(null, "g", new Tree[] { }),
605 new Tree(null, "e", new Tree[] { })})})}),
606 new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "]", new Tree[] { })})})})}),
607 new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})}),
608 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
609 new Tree(null, "s", new Tree[] { })})})}),
610 new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { }),
611 new Tree(null, "*", new Tree[] { })}),
612 new Tree(null, null, new Tree[] { })})}),
613 new Tree(null, null, new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})}),
614 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
615 new Tree(null, "s", new Tree[] { })})})}),
616 new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { })}),
617 new Tree(null, null, new Tree[] { })})})})})})}),
618 new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})})}),
619 new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { }),
620 new Tree(null, "/", new Tree[] { })}),
621 new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})})})}),
622 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
623 new Tree(null, "s", new Tree[] { })})})}),
624 new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})}),
625 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
626 new Tree(null, "s", new Tree[] { })})})}),
627 new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { }),
628 new Tree(null, "+", new Tree[] { })}),
629 new Tree(null, null, new Tree[] { })})}),
630 new Tree(null, null, new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})}),
631 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
632 new Tree(null, "s", new Tree[] { })})})}),
633 new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { })}),
634 new Tree(null, null, new Tree[] { })})})})})})}),
635 new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})})}),
636 new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { }),
637 new Tree(null, "/", new Tree[] { })}),
638 new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})})})}),
639 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
640 new Tree(null, "s", new Tree[] { })})})}),
641 new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { })})})}),
642 new Tree(null, null, new Tree[] { new Tree(null, "?", new Tree[] { })}),
643 new Tree(null, null, new Tree[] { })}),
644 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
645 new Tree(null, "s", new Tree[] { })})})}),
646 new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { })})}),
647 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
648 new Tree(null, "o", new Tree[] { }),
649 new Tree(null, "r", new Tree[] { }),
650 new Tree(null, "d", new Tree[] { })})})}),
651 new Tree(null, null, new Tree[] { new Tree(null, ")", new Tree[] { })}),
652 new Tree(null, null, new Tree[] { })}),
653 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
654 new Tree(null, "s", new Tree[] { })})})})}),
655 new Tree(null, null, new Tree[] { new Tree(null, "/", new Tree[] { new Tree(null, "ps2", new Tree[] { new Tree(null, null, new Tree[] { }),
656 new Tree(null, null, new Tree[] { new Tree(null, "(", new Tree[] { })}),
657 new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "a", new Tree[] { }),
658 new Tree(null, "l", new Tree[] { }),
659 new Tree(null, "t", new Tree[] { }),
660 new Tree(null, "e", new Tree[] { }),
661 new Tree(null, "r", new Tree[] { }),
662 new Tree(null, "n", new Tree[] { }),
663 new Tree(null, "a", new Tree[] { }),
664 new Tree(null, "t", new Tree[] { }),
665 new Tree(null, "i", new Tree[] { }),
666 new Tree(null, "v", new Tree[] { }),
667 new Tree(null, "e", new Tree[] { }),
668 new Tree(null, "s", new Tree[] { })})}),
669 new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ")", new Tree[] { })})})})}),
670 new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
671 new Tree(null, "s", new Tree[] { })})})})})})}),
672 new Tree(null, "!::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { })}),
673 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, " ", new Tree[] { })})})})}),
674 new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "/", new Tree[] { }),
675 new Tree(null, "/", new Tree[] { })})}),
676 new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "*", new Tree[] { new Tree(null, "[~", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, "\n", new Tree[] { })})})})})})})})})}),
677 new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\n", new Tree[] { })})})})}),
678 new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\n", new Tree[] { })})})})}),
679 new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\r", new Tree[] { })})})})})})})}),
680 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "w", new Tree[] { }),
681 new Tree(null, "o", new Tree[] { }),
682 new Tree(null, "r", new Tree[] { }),
683 new Tree(null, "d", new Tree[] { })}),
684 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "++", new Tree[] { new Tree(null, "[", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "-", new Tree[] { new Tree(null, "a", new Tree[] { }),
685 new Tree(null, "z", new Tree[] { })}),
686 new Tree(null, "-", new Tree[] { new Tree(null, "A", new Tree[] { }),
687 new Tree(null, "Z", new Tree[] { })}),
688 new Tree(null, "-", new Tree[] { new Tree(null, "0", new Tree[] { }),
689 new Tree(null, "9", new Tree[] { })}),
690 new Tree(null, "range", new Tree[] { new Tree(null, "_", new Tree[] { })})})})})})})})})}),
691 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "q", new Tree[] { }),
692 new Tree(null, "u", new Tree[] { }),
693 new Tree(null, "o", new Tree[] { }),
694 new Tree(null, "t", new Tree[] { }),
695 new Tree(null, "e", new Tree[] { }),
696 new Tree(null, "d", new Tree[] { })}),
697 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\"", new Tree[] { })})}),
698 new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+", new Tree[] { new Tree(null, "(", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "[~", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, "\"", new Tree[] { })}),
699 new Tree(null, "range", new Tree[] { new Tree(null, "\\", new Tree[] { })})})})})}),
700 new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "nonTerminal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
701 new Tree(null, "s", new Tree[] { }),
702 new Tree(null, "c", new Tree[] { }),
703 new Tree(null, "a", new Tree[] { }),
704 new Tree(null, "p", new Tree[] { }),
705 new Tree(null, "e", new Tree[] { }),
706 new Tree(null, "d", new Tree[] { })})})})})})})})})})})})})}),
707 new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\"", new Tree[] { })})})})}),
708 new Tree(null, "=>", new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\"", new Tree[] { }),
709 new Tree(null, "\"", new Tree[] { })})})})}),
710 new Tree(null, "", new Tree[] { })})})})}),
711 new Tree(null, "::=", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "e", new Tree[] { }),
712 new Tree(null, "s", new Tree[] { }),
713 new Tree(null, "c", new Tree[] { }),
714 new Tree(null, "a", new Tree[] { }),
715 new Tree(null, "p", new Tree[] { }),
716 new Tree(null, "e", new Tree[] { }),
717 new Tree(null, "d", new Tree[] { })}),
718 new Tree(null, null, new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\\", new Tree[] { }),
719 new Tree(null, "n", new Tree[] { })})})})}),
720 new Tree(null, null, new Tree[] { new Tree(null, "\n", new Tree[] { })})}),
721 new Tree(null, "=>", new Tree[] { new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\\", new Tree[] { }),
722 new Tree(null, "r", new Tree[] { })})})})}),
723 new Tree(null, null, new Tree[] { new Tree(null, "\r", new Tree[] { })})}),
724 new Tree(null, "ps", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "literal", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "\\", new Tree[] { })})}),
725 new Tree(null, "[~", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "range", new Tree[] { new Tree(null, "n", new Tree[] { })}),
726 new Tree(null, "range", new Tree[] { new Tree(null, "r", new Tree[] { })})})})})})})})})})}),
727 new Tree(null, null, new Tree[] { })})
728 // DO NOT EDIT STUFF ABOVE: IT IS AUTOMATICALLY GENERATED