/** parse <tt>input</tt> for a exactly one unique result, throwing <tt>Ambiguous</tt> if not unique or <tt>Failed</tt> if none */
- public Tree<R> parse1(Token.Stream<T> input) throws IOException, Failed, Ambiguous { return parse(input).expand1(); }
+ public Tree<R> parse1(Token.Stream<T> input) throws IOException, Failed, Ambiguous {
+ Forest<R> ret = parse(input);
+ try { return ret.expand1(); }
+ catch (Ambiguous a) {
+ System.out.println("while expanding:");
+ System.out.println(ret);
+ throw a;
+ }
+ }
/** parse <tt>input</tt>, using the table <tt>pt</tt> to drive the parser */
public Forest<R> parse(Token.Stream<T> input) throws IOException, Failed {
Walk.Follow wf = new Walk.Follow(top.empty(), p.owner(), all_elements, cache);
Reduction red = new Reduction(p);
state.reductions.put(wf.walk(p.owner()), red);
- if (wf.includesEof()) state.eofReductions.add(red, true);
+ if (wf.includesEof()) state.eofReductions.add(red);
}
// if the element following this position is an atom, copy the corresponding
/** a single state in the LR table and the transitions possible from it */
public class State implements Comparable<Table.State>, Iterable<Position> {
- public final int idx = master_state_idx++;
+ /*
+ public boolean isResolvable(Token t) {
+ boolean found = false;
+ for(Reduction r : getReductions(t)) {
+ Position p = r.position;
+ if (!p.isRightNullable(cache)) continue;
+ if (p.owner().firstp()==p) continue;
+ if (found) {
+ // found two items meeting criteria #1
+ return false;
+ } else {
+ found = true;
+ continue;
+ }
+ if (p.element()==null) continue;
+ Topology first = new Walk.First(top(), cache).walk(p.element());
+ if (first.contains(t))
+ }
+ }
+ */
+
+ public final int idx = master_state_idx++;
private final HashSet<Position> hs;
private transient HashMap<Element,State> gotoSetNonTerminals = new HashMap<Element,State>();
private transient TopologicalBag<Token,State> gotoSetTerminals = new TopologicalBag<Token,State>();
private TopologicalBag<Token,Reduction> reductions = new TopologicalBag<Token,Reduction>();
- private FastSet<Reduction> eofReductions = new FastSet<Reduction>();
+ private HashSet<Reduction> eofReductions = new HashSet<Reduction>();
private TopologicalBag<Token,State> shifts = new TopologicalBag<Token,State>();
private boolean accept = false;
public boolean canShift(Token t) { return shifts.contains(t); }
public Iterable<State> getShifts(Token t) { return shifts.get(t); }
public boolean isAccepting() { return accept; }
- public Iterable<Reduction> getReductions(Token t) { return reductions.get(t); }
+ public Iterable<Reduction> getReductions(Token t) { return t==null ? eofReductions : reductions.get(t); }
public Iterable<Reduction> getEofReductions() { return eofReductions; }
public Iterator<Position> iterator() { return hs.iterator(); }
public class Reduction {
// FIXME: cleanup; almost everything in here could go in either Sequence.Position.getRewrite() or else in GSS.Reduct
public final int numPop;
- private final Position position;
+ /*private*/ final Position position;
private final Forest[] holder; // to avoid constant reallocation
public int hashCode() { return position.hashCode(); }
public boolean equals(Object o) {
this.holder = new Forest[numPop];
}
public String toString() { return "[reduce " + position + "]"; }
- public Forest reduce(Forest f, GSS.Phase.Node parent, GSS.Phase.Node onlychild, GSS.Phase target, Forest rex) {
- holder[numPop-1] = f;
- return reduce(parent, numPop-2, rex, onlychild, target);
+
+ public Forest reduce(GSS.Phase.Node parent, GSS.Phase.Node onlychild, Forest rex) {
+ Forest ret = reduce(parent, numPop-1, rex, onlychild, parent.phase());
+ return ret;
+ }
+
+ public Forest reduce(GSS.Phase.Node parent, GSS.Phase.Node onlychild) {
+ int pos = numPop-1;
+ if (pos>=0) holder[pos] = parent.pending();
+ Forest rex = null;
+ if (pos==0) {
+ if (rex==null) {
+ System.arraycopy(holder, 0, position.holder, 0, holder.length);
+ rex = position.rewrite(parent.phase().getLocation());
+ }
+ }
+ return reduce(onlychild, pos-1, rex, null, parent.phase());
}
- public Forest reduce(GSS.Phase.Node parent, GSS.Phase.Node onlychild, GSS.Phase target, Forest rex) {
- return reduce(parent, numPop-1, rex, onlychild, target);
+
+ private Forest zero = null;
+ public Forest zero() {
+ if (zero != null) return zero;
+ if (numPop > 0) throw new Error();
+ return zero = position.rewrite(null);
}
// FIXME: this could be more elegant and/or cleaner and/or somewhere else
private Forest reduce(GSS.Phase.Node parent, int pos, Forest rex, GSS.Phase.Node onlychild, GSS.Phase target) {
if (pos>=0) holder[pos] = parent.pending();
- if (pos<=0 && rex==null) {
- System.arraycopy(holder, 0, position.holder, 0, holder.length);
- rex = position.rewrite(target.getLocation());
- }
- if (pos >=0) {
+ if (pos==0) {
+ if (rex==null) {
+ System.arraycopy(holder, 0, position.holder, 0, holder.length);
+ rex = position.rewrite(target.getLocation());
+ }
+ if (onlychild != null)
+ reduce(onlychild, pos-1, rex, null, target);
+ else
+ for(GSS.Phase.Node child : parent.parents())
+ reduce(child, pos-1, rex, null, target);
+ } else if (pos>0) {
if (onlychild != null)
reduce(onlychild, pos-1, rex, null, target);
else
} else {
State state = parent.state.gotoSetNonTerminals.get(position.owner());
if (state!=null)
- target.newNode(parent, rex, state, numPop<=0, parent.phase);
+ target.newNode(parent, rex, state, numPop<=0, parent.phase());
}
return rex;
}