module type T = sig
.. end
The output of the Create(S: Symbol_T)
functor, which is a module that
can be used to compose deterministic finite automata which operate on
symbols of the type specified.
module S: Cf_dfa.Symbol_T
The module used as the input to the Create(S: Symbol_T)
functor.
type (S.t #Cf_dfa.cursor, 'a)
t = (S.t #Cf_dfa.cursor as 'b, S.t, 'a) Cf_parser.X.t
A deterministic finite automata is a function of type
Cf_parser.X.t
that recognizes a stream of input symbols woven with objects of a
cursor class, and produces output according to the types of the rules
used in the composition of the automaton.
type
expr_t
The type of an expression in the regular grammar of an automaton.
type (S.t #Cf_dfa.cursor, 'a)
rule_t
The type of a rule for recognizing a sequence of symbols according to
the regular grammar of an automaton and producing an output token.
val nil : expr_t
The expression that matches the empty symbol sequence.
module Op: sig
.. end
Open this module to bring the composition operators into the current
scope.
val create : (S.t #Cf_dfa.cursor as 'a, 'b) rule_t -> ('a, 'b) t
Use create r
to compose a new DFA from the rule r
.