// Static Constructors //////////////////////////////////////////////////////////////////////////////
- public Sequence and(Sequence s) { Sequence ret = dup(); ret.needs.add(s); s.needed.add(ret); return ret; }
- public Sequence not(Sequence s) { Sequence ret = dup(); ret.hates.add(s); s.hated.add(ret); return ret; }
abstract Sequence _clone();
Sequence dup() {
Sequence ret = _clone();
return Atom.toAtom(elements[0]);
}
+ public Sequence and(Sequence s) { Sequence ret = dup(); ret.needs.add(s); s.needed.add(ret); return ret; }
+ public Sequence not(Sequence s) { Sequence ret = dup(); ret.hates.add(s); s.hated.add(ret); return ret; }
+
protected final Element[] elements;
final HashSet<Sequence> needed = new HashSet<Sequence>();
return epsilonForm;
}
- protected abstract <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args);
+ protected abstract <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args, Position p);
// Position //////////////////////////////////////////////////////////////////////////////
if (holder[i]==null) holder[i] = elements[i].epsilonForm();
if (holder[i]==null) throw new Error("bad " + i);
}
- Forest<T> ret = Sequence.this.postReduce(loc, holder);
+ Forest<T> ret = Sequence.this.postReduce(loc, holder, this);
for(int k=0; k<pos; k++) holder[k] = null; // to help GC
return ret;
}
private final Object result;
public Constant(Element[] e, Object result) { super(e); this.result = result; }
Sequence _clone() { return new Constant(elements, result); }
- public <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args) {
- return (Forest<T>)Forest.leaf(loc, result);
+ public <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args, Position p) {
+ return (Forest<T>)Forest.leaf(loc, result, p);
}
static class Drop extends Constant {
Sequence _clone() { return new Drop(elements, lame); }
private final int idx;
public Singleton(Element e) { this(new Element[] { e }, 0); }
public Singleton(Element[] e, int idx) { super(e); this.idx = idx; }
- public <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args) { return (Forest<T>)Forest.singleton(loc, args[idx]); }
+ public <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args, Position p) { return (Forest<T>)Forest.singleton(loc, args[idx], p); }
Sequence _clone() { return new Singleton(elements,idx); }
}
public Unwrap(Element[] e) { super(e); this.drops = null; }
public Unwrap(Element[] e, boolean[] drops) { super(e); this.drops = drops; }
Sequence _clone() { return new Unwrap(elements, drops); }
- public <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args) {
+ public <T> Forest<T> postReduce(Input.Location 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, null, args, true, false);
+ if (drops==null) return Forest.create(loc, null, args, true, false, p);
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, null, args2, true, false);
+ return Forest.create(loc, null, args2, true, false, p);
}
}
this.drops = drops == null ? new boolean[e.length] : drops;
for(int i=0; i<this.drops.length; i++) if (!this.drops[i]) count++;
}
- public <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args) {
+ public <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args, Position p) {
Forest<T>[] args2 = new Forest[count];
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, false);
+ return Forest.create(loc, (T)tag, args2, false, false, p);
}
public StringBuffer toString(StringBuffer sb, boolean spacing) {
int len = sb.length();