X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FNode.java;h=2cb33a9c76efae5dfd4405201da21ccf43541d9c;hp=b734a8f08a95516034cf5d6e4b9ffa99b78d7ea8;hb=4692c8e9ba0c4b44ac5222f5bf5168703c478cbd;hpb=9d727bd14c659cdc6c34153b988e8d3fdb8067f5 diff --git a/src/edu/berkeley/sbp/Node.java b/src/edu/berkeley/sbp/Node.java index b734a8f..2cb33a9 100644 --- a/src/edu/berkeley/sbp/Node.java +++ b/src/edu/berkeley/sbp/Node.java @@ -5,13 +5,14 @@ import edu.berkeley.sbp.*; import edu.berkeley.sbp.util.*; import edu.berkeley.sbp.Parser.Table.*; import edu.berkeley.sbp.Sequence.Position; +import edu.berkeley.sbp.Sequence.Pos; import java.io.*; import java.util.*; import java.lang.reflect.*; /** a node in the GSS */ final class Node - implements Invokable, + implements Invokable, IntegerMappable, GraphViz.ToGraphViz, Iterable { @@ -33,11 +34,11 @@ final class Node // - be on the frontier or // - have a non-doomed node closer to the frontier than themself if (phase.isFrontier()) dead = false; - for(Result r : children) - if (state.doomed) { if (r.usedByAnyNode()) { dead = false; break; } } - else { if (r.usedByNonDoomedNode()) { dead = false; break; } } + else for(Result r : children) + if (state.doomed) { if (r.usedByAnyNode()) { dead = false; break; } } + else { if (r.usedByNonDoomedNode()) { dead = false; break; } } dead |= results.size()==0; - if (!dead || destroyed) return; + if (!dead) return; destroyed = true; while(children.size()>0) for(Result r : children) { @@ -67,14 +68,17 @@ final class Node private HashSet results = new HashSet(); private HashSet children = new HashSet(); - public final void invoke(Position r, Result only) { + public final void invoke(Pos r, Result only) { boolean emptyProductions = only==null; - if (emptyProductions != (r.pos==0)) return; - if (r.pos==0) new Result(r.zero(phase().getLocation().createRegion(phase().getLocation())), this, r, phase()); - else reduce(r, r.pos-1, phase(), only); + if (emptyProductions != (r.numPops()==0)) return; + if (r.numPops()!=0) reduce(r, r.numPops()-1, phase(), only); + else { + Input.Region region = phase().getLocation().createRegion(phase().getLocation()); + new Result(r.rewrite(region, phase().parser().cache()), this, r, phase()); + } } - private void reduce(Position r, int pos, GSS.Phase target, Result only) { + private void reduce(Pos r, int pos, GSS.Phase target, Result only) { Forest[] holder = r.holder; Forest old = holder[pos]; if (results==null) return; // FIXME: this should not happen @@ -83,7 +87,10 @@ final class Node Node child = res.parent(); holder[pos] = res.getForest(); if (pos>0) child.reduce(r, pos-1, target, null); - else new Reduction(child, r, r.rewrite(child.phase().getLocation().createRegion(target.getLocation())), target); + else { + Input.Region region = child.phase().getLocation().createRegion(target.getLocation()); + new Reduction(child, r, r.rewrite(region, phase().parser().cache()), target); + } } holder[pos] = old; } @@ -127,7 +134,7 @@ final class Node if (results.size()==0) return null; if (gv.hasNode(this)) return gv.createNode(this); GraphViz.Node n = gv.createNode(this); - n.label = ""+state.toStringx(); + n.label = "state["+state.toInt()+"]"; n.shape = "rectangle"; boolean hasparents = false; for(Result r : results) n.edge(r, "");