Cf_lex_scan.CreateUse Create(B) to make a lexical analyzing scanner.
module DFA : Cf_dfa.Regular with type event := B.symbolThe regular syntax terms.
val string_to_term : string -> DFA.termUse string_to_term s to make a DFA term that represents the regular expression denoted by s.
Use simple t to make a scanner that produces lexemes matching t.
Use rule t f to make a rule to apply lexemes that match t to the production function f to make the value produced by the analyzer.
Use analyze s to make a lexical analyzing scanner that produces the annotated value from the first rule in s that matches the longest lexeme accepted by the DFA.
module Affix : sig ... endThis module contains useful affix operators.