while(!reductionQueue.isEmpty()) {
Reduction r = reductionQueue.poll();
//System.out.println("- " + r);
- if (r.parentPhase() != null)
- if (r.parentPhase().pos > minPhasePos)
+ if (r.predPhase() != null)
+ if (r.predPhase().pos > minPhasePos)
throw new Error();
r.perform();
- if (r.parentPhase() != null) {
- if (r.parentPhase().pos < minPhasePos) {
- minPhasePos = r.parentPhase().pos;
+ if (r.predPhase() != null) {
+ if (r.predPhase().pos < minPhasePos) {
+ minPhasePos = r.predPhase().pos;
best = r;
- } else if (r.parentPhase().pos == minPhasePos) {
+ } else if (r.predPhase().pos == minPhasePos) {
/*
if (best != null && Parser.mastercache.comparePositions(r.reduction(), best.reduction()) < 0)
throw new Error("\n"+r+"\n"+best+"\n"+
finalResult.merge(r.getForest());
}
if (token == null) continue;
- Result result = new Result(f, null, null);
- result.addParent(n);
+ Result result = new Result(f, n, null);
n.state().invokeShifts(token, this, result);
}
numNewNodes = next==null ? 0 : next.hash.size();