package dolmen

  1. Overview
  2. Docs

Module Str.RegLanSource

Sourcetype _ t =
  1. | T
    (*

    String_RegLan: ttype: type constructor for Regular languages over strings.

    *)
  2. | Empty
    (*

    Re_empty: String_RegLan: the empty language.

    *)
  3. | All
    (*

    Re_all: String_RegLan: the language of all strings.

    *)
  4. | Allchar
    (*

    Re_allchar: String_RegLan: the language of all singleton strings.

    *)
  5. | Of_string
    (*

    Re_of_string: String -> String_RegLan: the singleton language with a single string.

    *)
  6. | Range
    (*

    Re_range: String -> String -> String_RegLan: Language range Re_range s1 s2 is the set of all *singleton* strings s such that Str_lexicographic_large s1 s s2 provided s1 and s1 are singleton. Otherwise, it is the empty language.

    *)
  7. | Concat
    (*

    Re_concat: String_RegLan -> String_RegLan -> String_RegLan: language concatenation.

    *)
  8. | Union
    (*

    Re_union: String_RegLan -> String_RegLan -> String_RegLan: language union.

    *)
  9. | Inter
    (*

    Re_inter: String_RegLan -> String_RegLan -> String_RegLan: language intersection.

    *)
  10. | Star
    (*

    Re_star: String_RegLan -> String_RegLan: Kleen star.

    *)
  11. | Cross
    (*

    Re_cross: String_RegLan -> String_RegLan: Kleen cross.

    *)
  12. | Complement
    (*

    Re_complement: String_RegLan -> String_RegLan: language complement.

    *)
  13. | Diff
    (*

    Re_diff: String_RegLan -> String_RegLan -> String_RegLan: language difference.

    *)
  14. | Option
    (*

    Re_option: String_RegLan -> String_RegLan: language option Re_option e abbreviates Re_union e (Str_to_re "").

    *)
  15. | Power of int
    (*

    Re_power(n): String_RegLan -> String_RegLan: Re_power(n) e is the nth power of e:

    • Re_power(0) e is Str_to_re ""
    • Re_power(n+1) e is Re_concat e (Re_power(n) e)
    *)
  16. | Loop of int * int
    (*

    Re_loop(n1,n2): String_RegLan -> String_RegLan: Defined as:

    • Re_loop(n₁, n₂) e is Re_empty if n₁ > n₂
    • Re_loop(n₁, n₂) e is Re_power(n₁) e if n₁ = n₂
    • Re_loop(n₁, n₂) e is Re_union ((Re_power(n₁) e) ... (Re_power(n₂) e)) if n₁ < n₂
    *)