this.firstp = new Position(this, 0, null);
}
- abstract Forest epsilonForm(Input.Region loc, Grammar cache);
+ abstract Forest epsilonForm(Input.Region loc);
- protected abstract <T> Forest<T> postReduce(Input.Region loc, Forest<T>[] args, Pos p);
+ protected abstract <T> Forest<T> postReduce(Input.Region loc, Forest<T>[] args, Position p);
// Position //////////////////////////////////////////////////////////////////////////////
static abstract class Pos implements IntegerMappable, Comparable<Pos>, Serializable {
public int ord = -1;
+ private transient Sequence owner;
+
public int ord() { return ord; }
final Forest[] holder;
- Pos(int len) { this.holder = new Forest[len]; }
+ Pos(int len, Sequence owner) {
+ this.owner = owner;
+ this.holder = new Forest[len];
+ }
public abstract int provides();
public abstract int[] needs();
public abstract Pos prev();
public abstract Pos next();
- abstract Sequence owner();
+ /** the element which produces the sequence to which this Position belongs */
+ public Sequence owner() { return owner; }
+
abstract Element element();
public abstract int numPops();
- public abstract <T> Forest<T> rewrite(Input.Region loc, Grammar cache);
+ public abstract <T> Forest<T> rewrite(Input.Region loc);
}
/** the imaginary position before or after an element of a sequence; corresponds to an "LR item" */
public int[] hates();
public boolean owner_needed_or_hated();
public int numPops();
- public <T> Forest<T> rewrite(Input.Region loc, Grammar cache)
+ public <T> Forest<T> rewrite(Input.Region loc)
};
}
*/
- public int ord = -1;
- public int ord() { return ord; }
public int numPops() { return pos; }
final int pos;
private final Position next;
private final Position prev;
- private transient Sequence owner;
public int provides() { return owner().sernum; }
public int[] needs() { return owner().needs_int(); }
public boolean owner_needed_or_hated() { return owner().needed_or_hated; }
private Position(Sequence owner, int pos, Position prev) {
- super(owner.elements.length);
- this.owner = owner;
+ super(owner.elements.length,owner);
this.pos = pos;
this.next = pos==owner.elements.length ? null : new Position(owner, pos+1, this);
this.prev = prev;
/** the element immediately after this Position, or null if this is the last Position */
public Element element() { return pos>=owner().elements.length ? null : owner().elements[pos]; }
- /** the element which produces the sequence to which this Position belongs */
- public Sequence owner() { return owner; }
-
/** the next Position (the Position after <tt>this.element()</tt>) */
public Position next() { return next; }
// Position /////////////////////////////////////////////////////////////////////////////////
- public final <T> Forest<T> rewrite(Input.Region loc, Grammar cache) {
- if (this==firstp()) epsilonForm(loc, cache);
+ public final <T> Forest<T> rewrite(Input.Region loc) {
+ if (isFirst()) return owner().epsilonForm(loc);
for(int i=0; i<pos; i++) if (holder[i]==null) throw new Error("realbad " + i);
- for(int i=pos; i<elements.length; i++) {
- if (holder[i]==null) holder[i] = ((Union)elements[i]).epsilonForm(loc, cache);
+ for(int i=pos; i<owner().elements.length; i++) {
+ if (holder[i]==null) holder[i] = ((Union)owner().elements[i]).epsilonForm(loc);
if (holder[i]==null) throw new Error("bad");
}
- return Sequence.this.postReduce(loc, holder, this);
+ return owner().postReduce(loc, holder, this);
}
public String toString() {
return sb;
}
-
// Specialized Subclasses //////////////////////////////////////////////////////////////////////////////
static class Singleton extends Sequence {
public Singleton(Element[] e, int idx) { super(e); this.idx = idx; }
public <T> Forest<T> postReduce(Input.Region loc, Forest<T>[] args, Position p) { return args[idx]; }
Sequence _clone() { return new Singleton(elements,idx); }
- Forest epsilonForm(Input.Region loc, Grammar cache) {
- return ((Union)elements[idx]).epsilonForm(loc, cache);
+ Forest epsilonForm(Input.Region loc) {
+ return ((Union)elements[idx]).epsilonForm(loc);
}
}
if (spacing) for(int i=0; i<50-len; i++) sb.append(' ');
return sb;
}
- Forest epsilonForm(Input.Region loc, Grammar cache) {
+ Forest epsilonForm(Input.Region loc) {
return Forest.create(loc, tag, new Forest[0], lifts);
}
}