private Forest.Ref holder = null;
private boolean allqueued = false;
- /** the set of nodes to which there is an edge starting at this node */
- //public final FastSet<Node> parents = new FastSet<Node>(); /* ALLOC */
-
/** what state this node is in */
public final Parser.Table.State state;
if (!allqueued) { queueReductions(); return; }
for(Parser.Table.Reduction r : state.getReductions(token))
if (r.numPop > 0)
- r.reduce(this, n2, null);
+ r.reduce(this, n2);
}
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());
+ }
+
private Forest zero = null;
public Forest zero() {
if (zero != null) return zero;