equal
deleted
inserted
replaced
1 <HTML><HEAD><TITLE>HOL/Lex/ReadMe</TITLE></HEAD> |
1 <HTML><HEAD><TITLE>HOL/Lex/README</TITLE></HEAD> |
2 <BODY> |
2 <BODY> |
3 |
3 |
4 <H1>A Simplified Scanner Generator</H1> |
4 <H1>A Simplified Scanner Generator</H1> |
5 |
5 |
6 This is half of a simplified functional scanner generator. The overall design |
6 This is half of a simplified functional scanner generator. The overall design |
32 |
32 |
33 The auto_chopper is implemented in theory AutoChopper. The top part of the |
33 The auto_chopper is implemented in theory AutoChopper. The top part of the |
34 diagram, i.e. the translation of regular expressions into deterministic |
34 diagram, i.e. the translation of regular expressions into deterministic |
35 finite automata is still missing. <P> |
35 finite automata is still missing. <P> |
36 |
36 |
37 <H2>M.Sc./Diplom/Fopra Project</H2> |
|
38 |
|
39 Task: formalize the translation of regular expressions into deterministic |
|
40 finite automata. We are looking for a theoretically inclined student who |
|
41 likes automata theory and is not afraid of logic and proofs. Sounds |
|
42 interesting? Then contact <A |
|
43 HREF="http://www4.informatik.tu-muenchen.de/~nipkow/">Tobias Nipkow</A> or <A |
|
44 HREF="http://www4.informatik.tu-muenchen.de/~pusch/">Cornelia Pusch</A>. |
|
45 This project is also suitable as a joint "Fopra" for two students. |
|
46 |
|
47 </BODY> |
37 </BODY> |
48 </HTML> |
38 </HTML> |