return n;
}
- public Object _backslash__leftbrace_(String s) { return SELF; }
public Object _leftbrace_(PreSequence p) {
return nonTerminal("braced"+(anon++),
new PreSequence[][] {
false);
}
- public PreSequence _equals__greater_(PreSequence p, String tag) { p.tag = tag; return p; }
-
- public PreSequence ps(Object[] o) { return new PreSequence(o); }
public PreSequence ps2(Object[] o1, String s, Object[] o2) {
if (o1==null) o1 = new Object[0];
if (o2==null) o2 = new Object[0];
ret.drops[o1.length] = o3.length>1;
return ret;
}
- public PreSequence _slash_(PreSequence p, Object sep) { return p.sparse(sep); }
public String string(Tree<String> tree) {
String ret = "";
else if ("literal".equals(head)) { Element ret = string(string(tree.child(0))); dropAll.add(ret); return ret; }
else if ("-".equals(head)) return new Range(walk(tree, 0).toString().charAt(0), walk(tree,1).toString().charAt(0));
else if ("range".equals(head)) return new Range(walk(tree, 0).toString().charAt(0), walk(tree,0).toString().charAt(0));
- else if ("[".equals(head)) return ranges(true, (Range[])walk(tree, 0));
- else if ("[~".equals(head)) return ranges(false, (Range[])walk(tree, 0));
+ else if ("gram".equals(head)) return walk(tree, 1);
+ else if ("=>".equals(head)) { PreSequence p = (PreSequence)walk(tree, 0); p.tag = string(tree.child(1)); return p; }
+ else if ("/".equals(head)) return ((PreSequence)walk(tree, 0)).sparse((Element)walk(tree, 1));
+ else if ("ps".equals(head)) return new PreSequence((Element[])walk(tree, 0));
+ else if ("[".equals(head) || "[~".equals(head)) {
+ boolean positive = "[".equals(head);
+ Range[] rr = (Range[])walk(tree, 0);
+ Range.Set ret = positive ? new Range.Set() : new Range.Set(new Range(true, true));
+ if (rr != null)
+ for(Range r : rr)
+ if (positive) ret.add(r);
+ else ret.remove(r);
+ return set(ret);
+ }
else return super.walk(tree);
}
- public Object gram(Object o, Object g, Object o2) { return g; }
- public Element ranges(boolean positive, Range[] rr) {
- Range.Set ret = positive ? new Range.Set() : new Range.Set(new Range(true, true));
- if (rr != null)
- for(Range r : rr)
- if (positive) ret.add(r);
- else ret.remove(r);
- return set(ret);
- }
//////////////////////////////////////////////////////////////////////////////