public InnerAmbiguous(Forest<?> f) { this.f = f; }
}
- static <T> Forest<T> leaf(Input.Region loc, T tag, Position p) { return create(loc, tag, null, false, p); }
- public static <T> Forest<T> create(Input.Region loc, T tag, Forest<T>[] tokens, boolean unwrap, Position p) {
+ static <T> Forest<T> leaf(Input.Region loc, T tag) { return create(loc, tag, null, false); }
+ public static <T> Forest<T> create(Input.Region loc, T tag, Forest<T>[] tokens, boolean unwrap) {
return new MyBody<T>(loc, tag, tokens, unwrap);
}
// Body //////////////////////////////////////////////////////////////////////////////
GSS gss = new GSS();
Input.Location loc = input.getLocation();
GSS.Phase current = gss.new Phase<Tok>(null, this, null, input.next(), loc, null);
- current.newNode(null, Forest.leaf(null, null, null), pt.start, true);
+ current.newNode(null, Forest.leaf(null, null), pt.start, true);
int count = 1;
for(int idx=0;;idx++) {
Input.Location oldloc = loc;
public Constant(Element[] e, Object result) { super(e); this.result = result; }
Sequence _clone() { return new Constant(elements, result); }
public <T> Forest<T> postReduce(Input.Region loc, Forest<T>[] args, Position p) {
- return (Forest<T>)Forest.leaf(loc, result, p);
+ return (Forest<T>)Forest.leaf(loc, result);
}
static class Drop extends Constant {
Sequence _clone() { return new Drop(elements, lame); }
Sequence _clone() { return new Unwrap(elements, drops); }
public <T> Forest<T> postReduce(Input.Region loc, Forest<T>[] args, Position p) {
for(int i=0; i<args.length; i++) if (args[i]==null) throw new Error();
- if (drops==null) return Forest.create(loc, (T)tag, args, true, p);
+ if (drops==null) return Forest.create(loc, (T)tag, args, true);
int count = 0;
for(int i=0; i<drops.length; i++) if (!drops[i]) count++;
Forest<T>[] args2 = new Forest[count];
int j = 0;
for(int i=0; i<args.length; i++) if (!drops[i]) args2[j++] = args[i];
- return Forest.create(loc, (T)tag, args2, true, p);
+ return Forest.create(loc, (T)tag, args2, true);
}
}
int j = 0;
for(int i=0; i<args.length; i++) if (!drops[i]) args2[j++] = args[i];
//System.out.println("reduce \""+tag+"\"");
- return Forest.create(loc, (T)tag, args2, false, p);
+ return Forest.create(loc, (T)tag, args2, false);
}
public StringBuffer toString(StringBuffer sb, boolean spacing) {
int len = sb.length();
public CharParser(Union u) { super(u, new CharTopology()); }
public Forest<String> shiftToken(Location oldloc, Character ct, Location newloc) {
- return Forest.create(new Input.Region(oldloc, newloc), ct.toString(), null, false, null);
+ return Forest.create(new Input.Region(oldloc, newloc), ct.toString(), null, false);
}
}