# Module Cf_regex.DFA

    module DFA: Cf_dfa.T  with type S.t = char

The deterministic finite automata on octet character symbols.

    module S: Cf_dfa.Symbol_T

The module used as the input to the `Create(S: Symbol_T)` functor.

    type x

The type of an expression in the regular grammar of an automaton.

    type 'a r

The type of a rule for recognizing a sequence of symbols according to the regular grammar of an automaton and producing an output token.

    type 'a t = (S.t, 'a) Cf_parser.t

A parser that works on the symbols used in the automaton.

    val nil : x

The expression that matches the empty symbol sequence.

    module type Expr_Op_T = sig .. end

The signature of modules containing operators for composing DFA expressions.

    module Expr_Op: Expr_Op_T

The module containing the expression operators.

    module type Op_T = sig .. end

The signature of the `Op` module, which contains the composition operators.

    module Op: Op_T

Open this module to bring the composition operators into the current scope.

    val create : 'a r -> 'a t

Use `create r` to construct a parser that recognizes the longest sequence that matches the rule `r`.

    module X: sig .. end

A module of extensions for working with input sequences that require position information in the parse function.