A Simplified Scanner Generator

This directory contains the theories for the functional scanner generator described here. In contrast to the paper, the latest version of the theories provides a fully executable scanner generator. The non-executable bits (transitive closure) have been eliminated by going from regular expressions directly to nondeterministic automata, thus bypassing epsilon-moves.

Overview:
Automata
AutoProj, NA, NAe, DA, Automata
Regular expressions and their conversion to automata
RegSet, RegExp, RegExp2NA, RegExp2NAe
Scanning
Prefix, MaxPrefix, MaxChop, AutoMaxChop, Scanner
In addition there are some bits and pieces: