Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  val Universe: Rx

   The regular expression that matches all possible strings.

   The regular expression that matches all possible strings.

   The expression for the universe is: '.*'

5.  def apply(s: String): Rx

   Construct a regular expression that matches the string s.

6.  def apply(cs: NumericRange[Char]): Rx

   Construct a regular expression that matches one character from the given set cs, expressed as a range (e.g.

   Construct a regular expression that matches one character from the given set cs, expressed as a range (e.g. c1 to c2).

7.  def apply(cs: Set[Char]): Rx

   Construct a regular expression that matches one character from the given set cs.

8.  def apply(cs: LetterSet): Rx

   Construct a regular expression that matches one character from the given set cs.

9.  def apply(c: Char): Rx

   Construct a regular expression that matches the given character c.

10.  final def asInstanceOf[T0]: T0

    Definition Classes

    Any

11.  def canonicalize(r: Rx): Rx
12.  def cardinalityOf(r: Rx): Size
13.  def choice(rs: Iterable[Rx]): Rx

    Construct a regular expression from the union of rs.

    Construct a regular expression from the union of rs.

    If rs is empty, this method returns ϕ.

14.  def clone(): AnyRef

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()

15.  def closure(alphabet: LetterSet): Rx

    Compute the closure for the given alphabet.

    Compute the closure for the given alphabet.

    The closure is the set of all possible strings using characters from the alphabet. The closure of '.' is the universe.

16.  def concat(rs: Iterable[Rx]): Rx

    Construct a regular expression from the concatenation of rs.

    Construct a regular expression from the concatenation of rs.

    If rs is empty, this method returns ε.

17.  def difference(r1: Rx, r2: Rx): Rx
18.  val dot: Rx

    Dot (.) matches any single character.

    Dot (.) matches any single character.

    This is equivalent (and represented internally) as the character group [-￿].

19.  def empty: Rx

    Empty (ε) is the empty regular expression.

    Empty (ε) is the empty regular expression.

    Empty corresponds to the 'one' element of the Kleene algebra of regular expressions:

    ε * x = x * ε = x ε.star = ε

    Its set of accepted strings contains only the empty string. Most regular expression syntaxes denote this with an empty string, for example in 'a(b|)'.

20.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

21.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

22.  def equiv(lhs: Rx, rhs: Rx): Boolean

    Semantic equivalence for regular expressions.

23.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

24.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

25.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

26.  def intersect(r1: Rx, r2: Rx): Rx
27.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

28.  def lexCompare(lhs: Rx, rhs: Rx): Int

    Lexicographic ordering for Rx.

    Lexicographic ordering for Rx.

    To compare two sets, the comparison considers the union of all strings accepted by either in lexicographic ordering and finds the "last" string (lexicographically) that is accepted by one but not the other. The regex that doesn't accept this string comes first.

    For example /b/ < /[ac]/, but /[bc]/ > /[ac]/.

    Facts about this ordering:

    • Phi comes first and .* comes last
    • if x is a subset of y, then lexCompare(x, y) <= 0
    • if x is a superset of y, then lexCompare(x, y) >= 0
    • x <= y and y <= z implies x <= y
29.  val lexicographicOrdering: Ordering[Rx]
30.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

31.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

32.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

33.  def parse(s: String): Rx

    Parse the given string into a regular expression.

    Parse the given string into a regular expression.

    The syntax used is a subset of the Java Regex syntax.

34.  def phi: Rx

    Phi (ϕ) is the unmatchable regular expression.

    Phi (ϕ) is the unmatchable regular expression.

    Phi corresponds to the 'zero' element of the Kleene algebra of regular expressions:

    ϕ + x = x * ϕ = x ϕ * x = x * ϕ = ϕ ϕ.star = ε

    Its set of accepted strings is the empty set. Most regular expression syntaxes do not support ϕ.

35.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

36.  def toString(): String

    Definition Classes

    AnyRef → Any

37.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

39.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()

40.  def xor(r1: Rx, r2: Rx): Rx
41.  object Empty extends Rx with Product with Serializable
42.  object Phi extends Rx with Product with Serializable