////////////////////////////////////////////////////////////////////////////////
public Element noFollow = null;
////////////////////////////////////////////////////////////////////////////////
public Element noFollow = null;
protected Sequence(Element[] elements, HashSet<Sequence> and, HashSet<Sequence> not) {
this.needs = and==null ? new HashSet<Sequence>() : and;
this.hates = not==null ? new HashSet<Sequence>() : not;
protected Sequence(Element[] elements, HashSet<Sequence> and, HashSet<Sequence> not) {
this.needs = and==null ? new HashSet<Sequence>() : and;
this.hates = not==null ? new HashSet<Sequence>() : not;
+ if (this.needs != null)
+ for(Sequence s : this.needs)
+ (s.needed==null?(s.needed=new HashSet<Sequence>()):s.needed).add(this);
+ if (this.hates != null)
+ for(Sequence s : this.hates)
+ (s.hated==null?(s.hated=new HashSet<Sequence>()):s.hated).add(this);
- Forest epsilonForm() { return firstp().rewrite(null); }
+ // DO NOT MESS WITH THE FOLLOWING LINE!!!
+ private Forest.Ref epsilonForm = null;
+ private boolean eps = false;
+ Forest epsilonForm() {
+ if (epsilonForm==null) {
+ epsilonForm = new Forest.Ref();
+ epsilonForm.merge(firstp().rewrite2(null));
+ }
+ return epsilonForm;
+ }
// Position //////////////////////////////////////////////////////////////////////////////
/** the imaginary position before or after an element of a sequence; corresponds to an "LR item" */
// Position //////////////////////////////////////////////////////////////////////////////
/** the imaginary position before or after an element of a sequence; corresponds to an "LR item" */
- public class Position {
+ public class Position implements IntegerMappable {
+
+ private Forest zero = null;
+ public Forest zero() {
+ if (zero != null) return zero;
+ if (pos > 0) throw new Error();
+ return zero = rewrite(null);
+ }
+
/** the element immediately after this Position, or null if this is the last Position */
public Element element() { return pos>=elements.length ? null : elements[pos]; }
/** the element immediately after this Position, or null if this is the last Position */
public Element element() { return pos>=elements.length ? null : elements[pos]; }
/** true iff this Position is the last one in the sequence */
public boolean isLast() { return next()==null; }
/** true iff this Position is the last one in the sequence */
public boolean isLast() { return next()==null; }
- // Reduction /////////////////////////////////////////////////////////////////////////////////
+ // Position /////////////////////////////////////////////////////////////////////////////////
+
+ final <T> Forest<T> rewrite(Input.Location loc) {
+ if (this==firstp()) return epsilonForm();
+ return rewrite2(loc);
+ }
- <T> Forest<T> rewrite(Token.Location loc) {
- for(int i=pos; i<elements.length; i++) if (holder[i]==null) holder[i] = elements[i].epsilonForm();
+ final <T> Forest<T> rewrite2(Input.Location 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] = elements[i].epsilonForm();
+ if (holder[i]==null) throw new Error("bad " + i);
+ }
Forest<T> ret = Sequence.this.postReduce(loc, holder);
for(int k=0; k<pos; k++) holder[k] = null; // to help GC
return ret;
Forest<T> ret = Sequence.this.postReduce(loc, holder);
for(int k=0; k<pos; k++) holder[k] = null; // to help GC
return ret;
static class Constant extends Sequence {
private final Object result;
public Constant(Element[] e, Object result, HashSet<Sequence> and, HashSet<Sequence> not) { super(e, and, not); this.result = result; }
static class Constant extends Sequence {
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);
+ public <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args) {
+ return (Forest<T>)Forest.leaf(loc, result);
}
static class Drop extends Constant {
public Drop(Element[] e, HashSet<Sequence> and, HashSet<Sequence> not, boolean lame) {
}
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; }
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(Input.Location loc, Forest<T>[] args) { return (Forest<T>)Forest.singleton(loc, args[idx]); }
private boolean[] drops;
public Unwrap(Element[] e, HashSet<Sequence> and, HashSet<Sequence> not) { super(e, and, not); this.drops = null; }
public Unwrap(Element[] e, boolean[] drops, HashSet<Sequence> and, HashSet<Sequence> not) { super(e, and, not); this.drops = drops; }
private boolean[] drops;
public Unwrap(Element[] e, HashSet<Sequence> and, HashSet<Sequence> not) { super(e, and, not); this.drops = null; }
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) {
- if (drops==null) return Forest.create(loc, null, args, this, true, false);
+ public <T> Forest<T> postReduce(Input.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, 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];
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);
private final boolean[] drops;
private int count = 0;
public RewritingSequence(Object tag, Element[] e, HashSet<Sequence> and, HashSet<Sequence> not) { this(tag, e, null, and, not); }
private final boolean[] drops;
private int count = 0;
public RewritingSequence(Object tag, Element[] e, HashSet<Sequence> and, HashSet<Sequence> not) { this(tag, e, null, and, not); }
this.drops = drops == null ? new boolean[e.length] : drops;
for(int i=0; i<this.drops.length; i++) if (!this.drops[i]) count++;
}
this.drops = drops == null ? new boolean[e.length] : drops;
for(int i=0; i<this.drops.length; i++) if (!this.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];
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, this, false, false);
+ //System.out.println("reduce \""+tag+"\"");
+ return Forest.create(loc, (T)tag, args2, false, false);