A Simplified Scanner Generator
This is half of a simplified functional scanner generator. The overall design
is like this:
regular expression
|
v
-----------
| mk_auto |
-----------
|
deterministic automaton
|
v
----------------
string --> | auto_chopper | --> chopped up string
----------------
A chopped up string is a pair of
- a prefix of the input string, chopped up into words of the language,
- together with the remaining suffix.
For example, if the language consists just of the word ab, the
input ababaab is partitioned into a chopped up prefix
[ab,ab] and the suffix aab.
The auto_chopper is implemented in theory AutoChopper. The top part of the
diagram, i.e. the translation of regular expressions into deterministic
finite automata is still missing.
M.Sc./Diplom/Fopra Project
Task: formalize the translation of regular expressions into deterministic
finite automata. We are looking for a theoretically inclined student who
likes automata theory and is not afraid of logic and proofs. Sounds
interesting? Then contact Tobias Nipkow or Cornelia Pusch.
This project is also suitable as a joint "Fopra" for two students.