+// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+
package edu.berkeley.sbp;
import edu.berkeley.sbp.*;
import edu.berkeley.sbp.util.*;
import java.lang.reflect.*;
/** implements Tomita's Graph Structured Stack */
-public class GSS {
+class GSS {
- public static int count = 0;
- public static int shifts = 0;
- public static int reductions = 0;
+ static int count = 0;
+ static int shifts = 0;
+ static int reductions = 0;
+ int resets = 0;
+ int waits = 0;
- public GSS() { }
+ Input input;
+
+ public GSS(Input input) { this.input = input; }
private Phase.Node[] reducing_list = null;
- public int resets = 0;
- public int waits = 0;
// FIXME: right now, these are the performance bottleneck
HashMapBag<Sequence,Phase.Waiting> waiting = new HashMapBag<Sequence,Phase.Waiting>();
HashMapBag<Integer,Sequence> expected = new HashMapBag<Integer,Sequence>();
/** FIXME */
- public Forest.Ref finalResult;
+ Forest.Many finalResult;
/** corresponds to a positions <i>between tokens</i> the input stream; same as Tomita's U_i's */
class Phase<Tok> implements Invokable<State, Forest, Phase<Tok>.Node>, IntegerMappable, GraphViz.ToGraphViz, Iterable<Phase.Node> {
private Phase next = null;
private Phase prev;
private Input.Location location;
+ private Input.Location nextLocation;
+ private Input.Location prevLocation;
+
public final Parser parser;
private Forest forest;
- public Phase(Phase prev, Parser parser, Phase previous, Tok token, Input.Location location, Forest forest) throws ParseFailed {
+ public Phase(Phase prev, Parser parser, Phase previous, Tok token, Input.Location location,
+ Input.Location nextLocation, Forest forest) throws ParseFailed {
+ this.prevLocation = prev==null ? location : prev.getLocation();
this.prev = prev;
this.forest = forest;
this.parser = parser;
this.pos = previous==null ? 0 : previous.pos+1;
this.token = token;
this.location = location;
+ this.nextLocation = nextLocation;
performed.clear();
reset();
}
public boolean isDone() throws ParseFailed {
if (token != null) return false;
if (token==null && finalResult==null)
- throw new ParseFailed(ParseFailed.error(ANSI.red("unexpected end of file\n"), token, hash.values()), getLocation());
+ throw new ParseFailed(ParseFailed.error(("unexpected end of file\n"),
+ token, hash.values()),
+ getLocation().createRegion(getLocation()), input);
return true;
}
+ public Input.Location getPrevLocation() { return prevLocation; }
public Input.Location getLocation() { return location; }
+ public Input.Region getRegion() { return getPrevLocation().createRegion(getLocation()); }
+ public Input.Location getNextLocation() { return nextLocation; }
/** add a new node (merging with existing nodes if possible)
* @param parent the parent of the new node
}
}
}
- if (!owner.lame)
- newNode(parent, pending, state, fromEmptyReduction);
+ newNode(parent, pending, state, fromEmptyReduction);
if (reduction != null) {
boolean redo = true;
while(redo) {
boolean ok = false;
for(Phase.Node n : hash.values()) {
if (token == null && n.state.isAccepting()) {
- if (finalResult==null) finalResult = new Forest.Ref();
+ if (finalResult==null) finalResult = new Forest.Many();
for(Object f : n.results())
finalResult.merge((Forest)f);
}
}
if (!good && token!=null)
- throw new ParseFailed(ParseFailed.error(ANSI.red("unexpected character ")+" \'"+
+ throw new ParseFailed(ParseFailed.error(("unexpected character ")+" \'"+
ANSI.purple(StringUtil.escapify(token+"", "\\\'\r\n"))+
"\' encountered at "+
- ANSI.green(getLocation())+"\n", token, hash.values()),
- getLocation());
+ ANSI.green(next.getRegion())+"\n", token, hash.values()),
+ next.getRegion(), input);
if (token==null && finalResult==null)
- throw new ParseFailed(ParseFailed.error(ANSI.red("unexpected end of file\n"), token, hash.values()),
- getLocation());
+ throw new ParseFailed(ParseFailed.error(("unexpected end of file at "+getLocation()+"\n"), token, hash.values()),
+ getLocation().createRegion(getLocation()), input);
}
/** 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 HashSet<Forest.Ref> resultMap = new HashSet<Forest.Ref>();
- public Iterable<Forest.Ref> results() { return resultMap; }
+ private HashSet<Forest.Many> resultMap = new HashSet<Forest.Many>();
+ public Iterable<Forest.Many> results() { return resultMap; }
public FastSet<Node> parents() { return set; }
public boolean merge(Node parent, Forest result) {
// FIXME: inefficient!
- for(Forest.Ref f : results()) {
+ for(Forest.Many f : results()) {
if (f.parents.contains(parent) /* UGLY: */ && f.parents.size()==1) {
f.merge(result);
return true;
}
}
- Forest.Ref f = new Forest.Ref();
+ Forest.Many f = new Forest.Many();
f.parents.add(parent);
f.merge(result);
resultMap.add(f);
}
if (n==null) return;
Forest[] holder = new Forest[r.pos];
- if (r.pos==0) n.finish(r, r.zero(), n.phase());
+ if (r.pos==0) n.finish(r, r.zero(n.phase().getLocation().createRegion(n.phase().getLocation())), n.phase());
else n.reduce(r, r.pos-1, n.phase(), null);
} else {
if (r.pos<=0) throw new Error("called wrong form of reduce()");
HashSet<Forest> rr = new HashSet<Forest>();
for(Forest result : results()) rr.add(result);
for(Forest result : rr)
- for(Node child : ((Forest.Ref<?>)result).parents) {
+ for(Node child : ((Forest.Many<?>)result).parents) {
if (only != null && child!=only) continue;
holder[pos] = result;
- if (pos==0) child.finish(r, r.rewrite(new Input.Region(child.phase().getLocation(), phase().getLocation())), target);
+ if (pos==0) child.finish(r, r.rewrite(child.phase().getLocation().createRegion(target.getLocation())), target);
else child.reduce(r, pos-1, target, null);
}