1 package edu.berkeley.sbp.misc;
4 import java.lang.reflect.*;
5 import java.lang.ref.*;
6 import edu.berkeley.sbp.*;
7 import edu.berkeley.sbp.*;
8 import edu.berkeley.sbp.util.*;
9 import edu.berkeley.sbp.*;
11 /** an implementation of Token for streams of Java <tt>char</tt> values */
12 public class CharToken implements Token, IntegerMappable {
14 // Public //////////////////////////////////////////////////////////////////////////////
16 public static class CharToStringParser extends Parser<CharToken,String> {
17 public CharToStringParser(Union u) { super(u, new IntegerTopology<CharToken>()); }
18 public Forest<String> shiftToken(CharToken ct, Token.Location loc) {
19 return Forest.create(loc, ct.result(), null, false, false);
23 public static class CharRange extends Atom<CharToken> {
24 private String esc(char c) { return StringUtil.escapify(c+"", "[]-~\\\"\'"); }
25 private Topology<CharToken> t;
26 public CharRange(Topology<CharToken> t) { this.t = t; }
27 public Topology<CharToken> top() { return t; }
28 public String toString() {
29 StringBuffer sb = new StringBuffer();
31 Range.Set ranges = ((IntegerTopology)top()).getRanges();
32 if (ranges.size() == -1 || ranges.size() > Character.MAX_VALUE/2) {
34 ranges = ranges.complement();
36 ranges = ranges.intersect(all);
37 for(Range r : ranges) {
38 if (r.isMinNegInf() || r.isMaxPosInf()) throw new Error("should not happen");
39 if (r.getMin()==r.getMax()) {
40 sb.append(esc((char)r.getMin()));
42 sb.append(esc((char)r.getMin()));
44 sb.append(esc((char)r.getMax()));
52 /** returns an element matching all characters between <tt>start</tt> and <tt>end</tt>, inclusive */
53 public static Atom positiveRange(char start, char end) {
54 return new CharRange(new IntegerTopology<CharToken>(new Range.Set(new Range((int)start, (int)end))));
57 /** returns an element matching all characters <b>not</b> between <tt>start</tt> and <tt>end</tt>, inclusive */
58 public static Atom negativeRange(char start, char end) {
59 return new CharRange(new IntegerTopology<CharToken>(new Range.Set(new Range((int)start, (int)end)).complement().intersect(all)));
62 public static final Atom leftBrace = new CharRange(new IntegerTopology<CharToken>(9998)) { public String toString() { return "{"; } };
63 public static final Atom rightBrace = new CharRange(new IntegerTopology<CharToken>(9999)) { public String toString() { return "}"; } };
64 public static final CharToken left = new CharToken((char)9998);
65 public static final CharToken right = new CharToken((char)9999);
67 private static final Range.Set all = new Range.Set(new Range(0, Character.MAX_VALUE));
68 public static final Atom any = new CharRange(new IntegerTopology<CharToken>(all));
69 public static final Atom none = new CharRange(new IntegerTopology<CharToken>());
70 public static IntegerTopology<CharToken> range(Range r) { return new IntegerTopology<CharToken>(r); }
71 public static Atom set(Range.Set r) { return new CharRange(new IntegerTopology<CharToken>(r)); }
73 /** returns an element which exactly matches the string given */
74 public static Element string(String s) {
75 if (s.length() == 0) return Union.epsilon;
76 final String escapified = "\""+StringUtil.escapify(s, "\"\r\n\\")+"\"";
78 if (s.length() == 1) {
80 new CharRange(new IntegerTopology<CharToken>((int)s.charAt(0))) {
81 public String toString() { return escapified; } };
83 Union ret2 = new Union("\""+s+"\"_str", true) {
84 public String toString() { return escapified; } };
85 Element[] refs = new Element[s.length()];
86 for(int i=0; i<refs.length; i++) refs[i] = new CharRange(new IntegerTopology<CharToken>((int)s.charAt(i)));
87 ret2.add(Sequence.constant(refs, s, null, null));
94 public static Topology<CharToken> top() { return new IntegerTopology<CharToken>(); }
95 public static Topology<CharToken> top(String s) throws java.text.ParseException {
96 return new IntegerTopology<CharToken>(Range.Set.parse(s));
99 // Private //////////////////////////////////////////////////////////////////////////////
102 public CharToken(char c) { this.c = c; }
103 public String result() { return c+""; }
104 public String toString() { return "\'"+StringUtil.escapify(c+"")+"\'"; }
106 //////////////////////////////////////////////////////////////////////////////////////////
108 public int toInt() { return (int)c; }
110 // Statics //////////////////////////////////////////////////////////////////////////////
112 public static class CartesianLocation implements Location {
113 public final int line;
114 public final int col;
115 public String toString() { return line + ":" + col; }
116 public CartesianLocation(int line, int col) { this.line = line; this.col = col; }
119 /** an implementation of Token.Stream for sequences of characters */
120 public static class Stream implements Token.Stream {
121 private final String message;
122 private final Reader r;
123 private int line = 1;
126 public Stream(String s) { this(new StringReader(s)); }
128 public Stream(Reader r) { this(r, null); }
129 public Stream(Reader r, String s) { this.r = r; this.message = s; }
131 public Stream(InputStream i) { this(i, null); }
132 public Stream(InputStream i, String s) { this(new InputStreamReader(i), s); }
134 private Line currentLine = new Line();
136 public StringBuffer line = new StringBuffer();
139 private class LocWrap implements Location {
140 Line myline = Stream.this.currentLine;
141 public final int line;
142 public final int col;
143 public String toString() { return line + ":" + col; }
144 public LocWrap(int line, int col) { this.line = line; this.col = col; }
145 public String getContext() {
146 StringBuffer spaces = new StringBuffer();
147 for(int i=0; i<col-1; i++) spaces.append(' ');
149 return " " + myline.line.toString() + "\n " + spaces.toString();
154 private Token.Location location = new LocWrap(1, 1);
155 public Token.Location getLocation() { return location; }
156 public Token next(int numstates, int resets, int waits) throws IOException {
158 if (i==-1) return null;
160 location = new LocWrap(line, col);
161 Token ret = new CharToken(c);
162 String s = line + "";
163 while(s.length() < 4) s = " " + s;
164 s = "line "+s+", col " + col;
165 while(s.length() < 20) s += " ";
166 s += "[ambiguity level: " + (numstates-1) + "] [resets: " + resets + "] [waits: " + waits + "]";
167 long now = System.currentTimeMillis();
170 System.out.print(" "+(message==null?"":message)+" " + s + " \r");
173 currentLine = new Line();
177 currentLine.line.append(c);