This covers the whole course. Take it after the last module.
Final quiz
Practical assessment: Build a lexer from regular expressions
Without using hints or the re module, write a program that reads token definitions as regular expressions (identifier, number, operator, whitespace) and splits source text into tokens using automata you build yourself.
Each token definition is compiled to an NFA with Thompson's construction
The NFAs are combined and converted to one DFA that remembers which token each accepting state belongs to
The lexer always takes the longest possible token, and the earlier definition when two tie
An invalid character is reported with its position
The program prints the tokens of a sample program and the number of DFA states
Final project
A regular-expression engine: Build a program that compiles a regular expression into a minimal DFA and uses it to match text, without the re module.
How it is evaluated
Correctness: the lexer and the regex engine agree with the definitions on all test inputs
Theory: you can explain each construction and why it preserves the language
Code quality: parsing, construction, conversion and matching are separate and tested
Explanation: a short report shows the automata for one expression at each stage
To complete this course
Score at least 70% on the final quiz
Solve the beginner and intermediate exercises in every lesson
Finish the final project and check it against the evaluation criteria