1 // Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
3 package edu.berkeley.sbp;
4 import edu.berkeley.sbp.*;
5 import edu.berkeley.sbp.util.*;
6 import edu.berkeley.sbp.Parser.Table.*;
7 import edu.berkeley.sbp.Sequence.Position;
10 import java.lang.reflect.*;
12 /** implements Tomita's Graph Structured Stack */
16 public GSS(Input input) { this.input = input; }
17 public Input getInput() { return input; }
19 // FIXME: right now, these are the performance bottleneck
20 HashMapBag<Integer,Sequence> performed = new HashMapBag<Integer,Sequence>();
23 Forest.Many finalResult;
25 /** corresponds to a positions <i>between tokens</i> the input stream; same as Tomita's U_i's */
26 class Phase<Tok> implements Invokable<State, Result, Object>, IntegerMappable, GraphViz.ToGraphViz, Iterable<Node> {
28 public PriorityQueue<Reduction> reductionQueue = new PriorityQueue<Reduction>();
30 public void invoke(State st, Result result, Object o) {
32 good |= next.newNode(result, st, false);
35 /** the token immediately after this phase */
39 public IntPairMap<Node> hash; /* ALLOC */
41 private Phase next = null;
43 private Input.Location location;
44 private Input.Location nextLocation;
45 private Input.Location prevLocation;
47 private Forest forest;
49 public Phase(Phase prev, Phase previous, Tok token, Input.Location location,
50 Input.Location nextLocation, Forest forest) throws ParseFailed {
51 this.prevLocation = prev==null ? location : prev.getLocation();
54 this.pos = previous==null ? 0 : previous.pos+1;
56 this.location = location;
57 this.nextLocation = nextLocation;
59 hash = new IntPairMap<Node>();
62 if (prev != null) prev.shift(this, forest);
65 public boolean isFrontier() { return next==null; }
66 public boolean isDone() throws ParseFailed {
67 if (token != null) return false;
68 if (token==null && finalResult==null)
69 ParseFailed.error("unexpected end of file", this);
73 public Input.Location getPrevLocation() { return prevLocation; }
74 public Input.Location getLocation() { return location; }
75 public Input.Region getRegion() { return getPrevLocation().createRegion(getLocation()); }
76 public Input.Location getNextLocation() { return nextLocation; }
78 /** perform all shift operations, adding promoted nodes to <tt>next</tt> */
79 public void shift(Phase next, Forest result) throws ParseFailed {
80 // this massively improves GC performance
81 if (prev!=null) prev.hash = null;
83 for(Node n : hash.values()) {
84 if (token == null && n.state().isAccepting()) {
85 if (finalResult==null) finalResult = new Forest.Many();
87 finalResult.merge(r.getForest());
89 if (token == null) continue;
90 n.state().invokeShifts(token, this, new Result(result, n, null), null);
92 for(Node n : hash.values()) n.check();
93 if (!good && token!=null) ParseFailed.error("unexpected character", this);
94 if (token==null && finalResult==null) ParseFailed.error("unexpected end of file", this);
97 /** perform all reduction operations */
98 public void reduce() throws ParseFailed {
99 while(!reductionQueue.isEmpty())
100 reductionQueue.poll().perform();
103 public void newNodeFromReduction(Result result, State state, boolean fromEmptyReduction, Position reduction) {
104 int pos = result.phase().pos;
105 Sequence owner = reduction.owner();
106 for(Sequence s : owner.hates)
107 if (performed.contains(pos, s))
109 for(Sequence s : owner.needs)
110 if (!performed.contains(pos, s))
112 if (owner.needed_or_hated && !performed.contains(pos, owner))
113 performed.add(pos, owner);
115 newNode(result, state, fromEmptyReduction);
118 /** add a new node (merging with existing nodes if possible)
119 * @param parent the parent of the new node
120 * @param result the SPPF result corresponding to the new node
121 * @param state the state that the new node is in
122 * @param fromEmptyReduction true iff this node is being created as a result of a reduction of length zero (see GRMLR paper)
123 * @param start the earliest part of the input contributing to this node (used to make merging decisions)
125 public boolean newNode(Result result, State state, boolean fromEmptyReduction) {
126 Node p = hash.get(state, result.phase());
127 if (p != null) { p.merge(result); return true; }
129 if (token != null && state.canShift(token)) break;
130 if (state.isAccepting()) break;
131 if (token==null) break;
132 if (!state.canReduce(token)) return false;
134 new Node(Phase.this, result, state, fromEmptyReduction); // ALLOC
138 public int toInt() { return pos+1; }
139 public int size() { return hash==null ? 0 : hash.size(); }
140 public int pos() { return pos; }
141 public Tok getToken() { return token; }
142 public Iterator<Node> iterator() { return hash.iterator(); }
143 public GSS getGSS() { return GSS.this; }
145 // GraphViz //////////////////////////////////////////////////////////////////////////////
147 public GraphViz.Node toGraphViz(GraphViz gv) {
148 if (gv.hasNode(this)) return gv.createNode(this);
149 GraphViz.Group g = gv.createGroup(this);
150 g.label = "Phase " + pos;
155 public boolean isTransparent() { return false; }
156 public boolean isHidden() { return false; }