- /** which Phase this Node belongs to (node that Node is also a non-static inner class of Phase) */
- public Phase phase() { return Phase.this; }
- //private HashMap<Node,Forest> resultMap = new HashMap<Node,Forest>();
-
- private HashSet<Forest.Ref> resultMap = new HashSet<Forest.Ref>();
- public void merge(Node parent, Forest result) {
- for(Forest.Ref f : results()) {
- if (f.parents.contains(parent) && f.parents.size()==1) {
- f.merge(result);
- return;
- }
- }
- Forest.Ref f = new Forest.Ref();
- f.parents.add(parent);
- f.merge(result);
- resultMap.add(f);
- set.add(parent, true);
- /*
- Forest.Ref f = (Forest.Ref)resultMap.get(parent);
- if (f==null) { f = new Forest.Ref(); resultMap.put(parent, f); }
- f.merge(result);
- set.add(parent, true);
- */
- }
- public Iterable<Forest.Ref> results() { return resultMap; }
- //private Forest pending(Node n) {
- //return !Phase.this.closed ? holder : holder.resolve();
- /*
- for(Forest f : resultMap)
- if (resultMap.contains(f, n))
- return f;
- return null;
- */
- /*
- return resultMap.get(n);
- }
- */
- public FastSet<Node> parents() { return set; }
-
- public void performReductions() {
- if (allqueued) return;
- allqueued = true;
- state.invokeReductions(token, this, this, null);
- }
-
- public void performReductions(Node n2) {
- if (!allqueued) performReductions();
- else state.invokeReductions(token, this, this, n2);
- }
-
- public void performEmptyReductions() { state.invokeReductions(token, this, null, null); }
- public final void invoke(Position r, Node n, Node n2) {
- //if (r.owner().lame) return;
- if (n==null || n2==null || r.pos==0) {
- if (r.pos==0) {
- if (n==null) n = this;
- else return;
- }
- if (n==null) return;
- Forest[] holder = new Forest[r.pos];
- if (r.pos==0) n.finish(r, r.zero(), n.phase(), holder);
- else n.reduce(r, r.pos-1, n.phase(), holder, null);
- } else {
- Forest[] holder = new Forest[r.pos];
- if (r.pos<=0) throw new Error("called wrong form of reduce()");
- int pos = r.pos-1;
- n.reduce(r, pos, n.phase(), holder, n2);
- }
- }
-
- public void reduce(Position r, int pos, Phase target, Forest[] holder, Node only) {
- Forest old = holder[pos];
-
- // FIXME: I'm unsure about this -- basically we want to deal with the case where
- // there are two nodes, each of whose Ref points to the same Forest instance.
- // Some node in the next phase has both of these as parents. This might happen
- // since the same reduction can appear in more than one state.
-
- for(Forest result : results())
- for(Node child : ((Forest.Ref<?>)result).parents) {
- if (only != null && child!=only) continue;
- holder[pos] = result;
- if (pos==0) {
- System.arraycopy(holder, 0, r.holder, 0, holder.length);
- for(int i=0; i<r.pos; i++) if (r.holder[i]==null) throw new Error("realbad");
- child.finish(r, r.rewrite(phase().getLocation()), target, holder);
- } else {
- child.reduce(r, pos-1, target, holder, null);
- }
- }
-
- holder[pos] = old;
- }
-
- public void finish(Position r, Forest result, Phase<Tok> target, Forest[] holder) {
- Parser.Table<Tok>.State<Tok> state0 = state.gotoSetNonTerminals.get(r.owner());
- if (result==null) throw new Error();
- if (state0!=null)
- target.newNode(this, result, state0, r.pos<=0, r);
- }
-
- private Node(Node parent, Forest pending, State state) {
- this.state = state;
- this.merge(parent, pending);
- Phase start = parent==null ? null : parent.phase();
- if (parent != null) parents().add(parent, true);
- if (Phase.this.hash.get(state, start) != null) throw new Error("severe problem!");
- Phase.this.hash.put(state, start, this);