// Static Constructors //////////////////////////////////////////////////////////////////////////////
- public abstract Sequence and(Sequence s);
- public abstract Sequence not(Sequence s);
-
- private void needs(Sequence s) { s.needed.add(this); needs.add(s); }
- private void hates(Sequence s) { s.hated.add(this); hates.add(s); }
+ abstract Sequence _clone();
+ Sequence dup() {
+ Sequence ret = _clone();
+ for(Sequence s : needs) { ret.needs.add(s); s.needed.add(ret); }
+ for(Sequence s : hates) { ret.hates.add(s); s.hated.add(ret); }
+ ret.noFollow = noFollow;
+ return ret;
+ }
/** the empty sequence (matches the empty string) */
public static final Sequence empty = new Sequence.Constant.Empty();
/** after matching the sequence, do not add anything to the output tree */
- public static Sequence drop(Element[] e, boolean lame) { return new Constant.Drop(e, null, null, lame); }
+ public static Sequence drop(Element[] e, boolean lame) { return new Constant.Drop(e, lame); }
/** after matching the sequence, insert a constant into the output tree */
- public static Sequence constant(Element[] e, Object o) { return new Constant(e, o, null, null); }
+ public static Sequence constant(Element[] e, Object o) { return new Constant(e, o); }
/** after matching the sequence, place the result of the <tt>idx</tt>th match in the output tree */
- public static Sequence singleton(Element[] e, int idx) { return new Singleton(e, idx, null, null); }
+ public static Sequence singleton(Element[] e, int idx) { return new Singleton(e, idx); }
/**
* after matching the sequence, create the specified output tree
* @param e the elements to match
* @param drops only elements of <tt>e</tt> whose corresponding <tt>boolean</tt> in <tt>drops</tt> is <i>false</i> will be included in the output tree
**/
- public static Sequence rewritingSequence(Object tag, Element[] e, boolean[] drops) { return new RewritingSequence(tag, e, drops, null, null); }
+ public static Sequence rewritingSequence(Object tag, Element[] e, Object[] labs, boolean[] drops) {
+ return new RewritingSequence(tag, e, labs, drops); }
////////////////////////////////////////////////////////////////////////////////
public Element noFollow = null;
- public String name = null;
- public void setName(String name) { this.name = name; }
- public final Topology noFollow() { return noFollow==null ? null : noFollow.toAtom(); }
+ public final Topology noFollow() { return noFollow==null ? null : Atom.toAtom(noFollow); }
Topology toAtom() {
if (elements.length!=1) throw new RuntimeException("cannot invoke toAtom() on a Sequence with " + elements.length + " elements: " + this);
- return elements[0].toAtom();
+ 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>();
Position firstp() { return firstp; }
public Iterator<Element> iterator() { return new ArrayIterator<Element>(elements); }
- protected Sequence(Element[] elements) { this(elements, null, null); }
- protected Sequence(Element[] elements, HashSet<Sequence> and, HashSet<Sequence> not) {
- if (and!=null) for(Sequence s : and) { needs.add(s); s.needed.add(this); }
- if (not!=null) for(Sequence s : not) { hates.add(s); s.hated.add(this); }
+ protected Sequence(Element[] elements) {
this.elements = elements;
this.firstp = new Position(0);
}
// 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));
- }
+ if (epsilonForm!=null) return epsilonForm;
+ epsilonForm = new Forest.Ref();
+ epsilonForm.merge(firstp().rewrite(null, false));
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 //////////////////////////////////////////////////////////////////////////////
// Position /////////////////////////////////////////////////////////////////////////////////
- final <T> Forest<T> rewrite(Input.Location loc) {
- if (this==firstp()) return epsilonForm();
- return rewrite2(loc);
- }
-
- final <T> Forest<T> rewrite2(Input.Location loc) {
+ final <T> Forest<T> rewrite(Input.Location loc) { return rewrite(loc, true); }
+ private final <T> Forest<T> rewrite(Input.Location loc, boolean epsilonCheck) {
+ if (epsilonCheck && this==firstp()) return epsilonForm();
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);
+ Forest<T> ret = Sequence.this.postReduce(loc, holder, this);
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; }
- public Sequence and(Sequence s) { Sequence ret = new Constant(elements, result, needs, hates); ret.needs(s); return ret; }
- public Sequence not(Sequence s) { Sequence ret = new Constant(elements, result, needs, hates); ret.hates(s); return ret; }
- public <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args) {
- return (Forest<T>)Forest.leaf(loc, 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, Position p) {
+ return (Forest<T>)Forest.leaf(loc, result, p);
}
static class Drop extends Constant {
- public Drop(Element[] e, HashSet<Sequence> and, HashSet<Sequence> not, boolean lame) {
- super(e, null, and, not);
+ Sequence _clone() { return new Drop(elements, lame); }
+ public Drop(Element[] e, boolean lame) {
+ super(e, null);
this.lame = lame;
}
}
- static class Empty extends Sequence.Constant.Drop { public Empty() { super(new Element[] { }, null, null, false); } }
+ static class Empty extends Sequence.Constant.Drop {
+ Sequence _clone() { return new Empty(); }
+ public Empty() { super(new Element[] { }, false); } }
}
static class Singleton extends Sequence {
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(Input.Location loc, Forest<T>[] args) { return (Forest<T>)Forest.singleton(loc, args[idx]); }
- public Sequence and(Sequence s) { Sequence ret = new Singleton(elements, idx, needs, hates); ret.needs(s); return ret; }
- public Sequence not(Sequence s) { Sequence ret = new Singleton(elements, idx, needs, hates); ret.hates(s); return ret; }
+ 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, Position p) { return (Forest<T>)Forest.singleton(loc, args[idx], p); }
+ Sequence _clone() { return new Singleton(elements,idx); }
}
public static class Unwrap extends Sequence {
private boolean[] drops;
public Unwrap(Element[] e) { super(e); this.drops = null; }
public Unwrap(Element[] e, boolean[] drops) { super(e); this.drops = drops; }
- public Sequence and(Sequence s) { Sequence ret = new Unwrap(elements, drops); ret.needs(s); return ret; }
- public Sequence not(Sequence s) { Sequence ret = new Unwrap(elements, drops); ret.hates(s); return ret; }
- public <T> Forest<T> postReduce(Input.Location loc, Forest<T>[] args) {
+ Sequence _clone() { return new Unwrap(elements, drops); }
+ 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, new Object[args.length], 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, new Object[args.length], true, false, p);
}
}
static class RewritingSequence extends Sequence {
/*private*/public final Object tag;
private final boolean[] drops;
+ private final Object[] labs;
private int count = 0;
- public Sequence and(Sequence s) { Sequence ret = new RewritingSequence(tag, elements, drops, needs, hates); ret.needs(s); return ret; }
- public Sequence not(Sequence s) { Sequence ret = new RewritingSequence(tag, elements, drops, needs, hates); ret.hates(s); return ret; }
- public RewritingSequence(Object tag, Element[] e, HashSet<Sequence> and, HashSet<Sequence> not) { this(tag, e, null, and, not); }
- public RewritingSequence(Object tag, Element[] e, boolean[] drops, HashSet<Sequence> and, HashSet<Sequence> not) {
- super(e, and, not);
+ Sequence _clone() { return new RewritingSequence(tag, elements, labs, drops); }
+ public RewritingSequence(Object tag, Element[] e, Object[] labs) { this(tag, e, labs, null); }
+ public RewritingSequence(Object tag, Element[] e, Object[] labs, boolean[] drops) {
+ super(e);
this.tag = tag;
this.drops = drops == null ? new boolean[e.length] : drops;
for(int i=0; i<this.drops.length; i++) if (!this.drops[i]) count++;
+ this.labs = labs;
}
- 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];
+ Object[] labs2 = new Object[count];
int j = 0;
- for(int i=0; i<args.length; i++) if (!drops[i]) args2[j++] = args[i];
+ for(int i=0; i<args.length; i++) if (!drops[i]) { labs2[j] = labs==null?null:labs[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, labs2, false, false, p);
}
public StringBuffer toString(StringBuffer sb, boolean spacing) {
int len = sb.length();