The regular syntax terms.

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

The type of a lexical analyzer 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.

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.

This module contains useful affix operators.