1 package edu.berkeley.sbp.chr;
4 import java.lang.reflect.*;
5 import java.lang.ref.*;
6 import edu.berkeley.sbp.*;
7 import edu.berkeley.sbp.util.*;
8 import edu.berkeley.sbp.misc.*;
9 import edu.berkeley.sbp.Input.Location;
11 public class CharAtom extends Atom<Character> {
13 public CharAtom() { this(new CharTopology()); }
14 public CharAtom(char a) { this(a,a); }
15 public CharAtom(char a, char b) { this(new CharTopology(a, b)); }
16 public CharAtom(CharTopology t) { this.t = t; }
17 public CharAtom(Topology<Character> t) { this(t instanceof CharTopology ? (CharTopology)t : new CharTopology(t)); }
19 private CharTopology t;
20 public Topology<Character> top() { return t; }
22 public static final char left = (char)9998;
23 public static final char right = (char)9999;
24 public static final Atom leftBrace = new CharAtom(left,left) { public String toString() { return "[{]"; } };
25 public static final Atom rightBrace = new CharAtom(right,right) { public String toString() { return "[}]"; } };
26 public static final Atom braces = new CharAtom(left,right) { public String toString() { return "[{}]"; } };
28 public static Atom set(Range.Set r) { return new CharAtom(new CharTopology(r)); }
29 public String toString() { return t.toString(); }
31 /** returns an element which exactly matches the string given */
32 public static Element string(String s) { return string(s, true); }
33 public static Element string(String s, boolean share) {
34 if (share && s.length() == 0) return epsilon;
35 final String escapified = "\""+StringUtil.escapify(s, "\"\r\n\\")+"\"";
37 if (share && s.length() == 1) {
39 new CharAtom(s.charAt(0)) {
40 public String toString() { return escapified; } };
42 Union ret2 = new Union("\""+s+"\"_str", true) {
43 public String toString() { return escapified; } };
44 Element[] refs = new Element[s.length()];
45 for(int i=0; i<refs.length; i++) refs[i] = new CharAtom(s.charAt(i));
46 ret2.add(Sequence.constant(refs, s));
52 private static Union epsilon = new Union("()");
53 static { epsilon.add(Sequence.empty); }
55 public Topology<Atom<Character>> unwrap() { return this; }
56 public Topology<Atom<Character>> empty() { return new CharAtom(); }
57 public Topology<Character> getTokenTopology() { return top(); }
59 public boolean contains(Atom<Character> v) { return top().containsAll(((CharAtom)v).top()); }
60 public boolean disjoint(Topology<Atom<Character>> t) { return top().disjoint(((CharAtom)t).top()); }
61 public boolean containsAll(Topology<Atom<Character>> t) { return top().containsAll(((CharAtom)t).top()); }
63 public Topology<Atom<Character>> complement() { return new CharAtom(top().complement()); }
64 public Topology<Atom<Character>> intersect(Topology<Atom<Character>> t) { return new CharAtom(top().intersect(((CharAtom)t).top())); }
65 public Topology<Atom<Character>> minus(Topology<Atom<Character>> t) { return new CharAtom(top().minus(((CharAtom)t).top())); }
66 public Topology<Atom<Character>> union(Topology<Atom<Character>> t) { return new CharAtom(top().union(((CharAtom)t).top())); }
68 public int hashCode() { return top().hashCode(); }
69 public boolean equals(Object o) { return o != null && (o instanceof CharAtom) && ((CharAtom)o).top().equals(top()); }