}
boolean isFirst() { return pos==0; }
- boolean isRightNullable(Walk.Cache cache) {
- if (isLast()) return true;
- if (!element().possiblyEpsilon(cache)) return false;
- return next().isRightNullable(cache);
- }
/** the element immediately after this Position, or null if this is the last Position */
public Element element() { return pos>=elements.length ? null : elements[pos]; }
for(Position p = Sequence.this.firstp(); p != null; p = p.next()) {
ret.append(' ');
if (p==this) ret.append(" | ");
- if (p.element()!=null) ret.append(p.element().possiblyEpsilon(null) ? "["+p.element()+"]" : p.element());
+ if (p.element()!=null) ret.append(p.element());
else ret.append(' ');
}
ret.append("}>");
private final Object result;
public Constant(Element[] e, Object result, HashSet<Sequence> and, HashSet<Sequence> not) { super(e, and, not); this.result = result; }
public <T> Forest<T> postReduce(Token.Location loc, Forest<T>[] args) {
- return (Forest<T>)Forest.leaf(loc, result, this);
+ return (Forest<T>)Forest.leaf(loc, result);
}
static class Drop extends Constant {
public Drop(Element[] e, HashSet<Sequence> and, HashSet<Sequence> not, boolean lame) {
private final int idx;
public Singleton(Element e, HashSet<Sequence> and, HashSet<Sequence> not) { this(new Element[] { e }, 0, and, not); }
public Singleton(Element[] e, int idx, HashSet<Sequence> and, HashSet<Sequence> not) { super(e, and, not); this.idx = idx; }
- public <T> Forest<T> postReduce(Token.Location loc, Forest<T>[] args) { return (Forest<T>)Forest.singleton(loc, args[idx], this); }
+ public <T> Forest<T> postReduce(Token.Location loc, Forest<T>[] args) { return (Forest<T>)Forest.singleton(loc, args[idx]); }
}
public static class Unwrap extends Sequence {
public Unwrap(Element[] e, boolean[] drops, HashSet<Sequence> and, HashSet<Sequence> not) { super(e, and, not); this.drops = drops; }
public <T> Forest<T> postReduce(Token.Location loc, Forest<T>[] args) {
for(int i=0; i<args.length; i++) if (args[i]==null) throw new Error();
- if (drops==null) return Forest.create(loc, null, args, this, true, false);
+ if (drops==null) return Forest.create(loc, null, args, true, false);
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, this, true, false);
+ return Forest.create(loc, null, args2, true, false);
}
}
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, this, false, false);
+ return Forest.create(loc, (T)tag, args2, false, false);
}
public StringBuffer toString(StringBuffer sb, boolean spacing) {
int len = sb.length();