Type Members

1.  final case class Alt(left: RegularLanguage, right: RegularLanguage) extends RegularLanguage with Product with Serializable

   Alt(left, right) represents the union of two regular languages.

   Alt(left, right) represents the union of two regular languages. We call it "Alt" for consistency with the names used in the "Parsing With Derivatives" paper.

2.  final case class Cat(left: RegularLanguage, right: RegularLanguage) extends RegularLanguage with Product with Serializable

   Cat(left, right) represents the concatenation of two regular languages.

3.  final case class Permutation(values: RegularLanguage*) extends RegularLanguage with Product with Serializable

   Permutation is like Cat, but it is a commutative monoid.

   Permutation is like Cat, but it is a commutative monoid. A Permutation(a_1, a_2, ..., a_{k}) is equivalent to the following language:

   a2 ~ Permutation(a_1, a_3, ..., a_k) | a1 ~ Permutation(a_2, a_3, ..., a_k) | ... ak ~ Permutation(a_1, a_2, ..., a_{k - 1})

   So when we calculate its derivative, we apply the above "desugaring" transformation, then compute the derivative as usual.

4.  final case class PrimTypeToken(value: PrimType[Any]) extends Token with Product with Serializable

   A PrimTypeToken(value) language represents the regular language containing any strings s where value.validate(s) succeeds.

5.  final case class Rep(language: RegularLanguage, min: Option[Int], max: Option[Int]) extends RegularLanguage with Product with Serializable

   Rep(language, min, max) represents the repetition of language.

   Rep(language, min, max) represents the repetition of language. The number of repetitions can be bounded via min and max. Setting max=None represents the "Kleene star" of language.

6.  final case class StringToken(value: String) extends Token with Product with Serializable

   A StringToken(value) language represents the regular language that contains only value.

7.  sealed trait Token extends RegularLanguage