1 // Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
3 package edu.berkeley.sbp;
4 import edu.berkeley.sbp.util.*;
5 import edu.berkeley.sbp.Sequence.Pos;
6 import edu.berkeley.sbp.Sequence.Pos;
9 final class Result implements GraphViz.ToGraphViz {
13 private HashSet<Node> successors = new HashSet<Node>();
14 private boolean destroyed = false;
15 private int usedByNonDoomedNode = 0;
16 private Pos reduction;
18 public GSS.Phase phase() { return pred==null ? null : pred.phase(); }
19 public Forest getForest() { return f; }
20 public Node pred() { return pred; }
21 public void addSucc(Node succ) {
23 usedByNonDoomedNode += succ.state().doomed ? 0 : 1;
25 public void removeSucc(Node succ) {
26 if (!successors.contains(succ)) return;
27 successors.remove(succ);
28 usedByNonDoomedNode -= succ.state().doomed ? 0 : 1;
32 public boolean usedByAnyNode() { return successors.size() > 0; }
33 public boolean usedByNonDoomedNode() { return usedByNonDoomedNode > 0; }
35 public String toString() { return super.toString()+"->"+pred(); }
37 public void check() { if (successors.size()==0) destroy(); }
38 public void destroy() {
39 if (destroyed) return;
40 if (pred==null) return; // never destroy the "primordeal" result
42 pred.removeSucc(this);
43 while(successors.size() > 0)
44 for(Node n : successors) {
51 public static void newResult(Forest f, Node pred, Pos reduction, GSS.Phase target) {
52 Result r = new Result(f, pred, reduction);
53 if (reduction == null) return;
54 Parser.Table.State state0 = (Parser.Table.State)pred.state().gotoSetNonTerminals.get(reduction);
55 target.newNodeFromReduction(r, state0, reduction);
57 public Result(Forest f, Node pred, Pos reduction) {
60 this.reduction = reduction;
61 if (pred != null) pred.addSucc(this);
64 // GraphViz //////////////////////////////////////////////////////////////////////////////
66 public GraphViz.Node toGraphViz(GraphViz gv) {
67 if (gv.hasNode(this)) return gv.createNode(this);
68 GraphViz.Node n = gv.createNode(this);
70 n.shape = "rectangle";
71 if (pred()!=null) n.edge(pred, "");
74 ((GraphViz.Group)phase().toGraphViz(gv)).add(n);
77 public boolean isTransparent() { return false; }
78 public boolean isHidden() { return false; }