Module Cf_lex_scan.ASCII

A distinguished lexical analyzer for simple ASCII character symbols.

module DFA : Cf_dfa.Regular with type event := char

The regular syntax terms.

val string_to_term : string -> DFA.term

Use string_to_term s to make a DFA term that represents the regular expression denoted by s.

val simple : DFA.term -> string Cf_scan.ASCII.t

Use simple t to make a scanner that produces lexemes matching t.

type 'a rule

The type of a lexical analyzer rule.

val rule : DFA.term -> (string -> 'a) -> 'a rule

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.

val analyze : 'a rule Seq.t -> 'a Cf_scan.ASCII.t

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 ... end

This module contains useful affix operators.