Next:
Finite Automata
Compiler Theory:
Lexical Analysis
Marc Moreno Maza
University of Western Ontario
CS447b - Winter 2004
Date:
2 December 2004
Finite Automata
Deterministic Finite Automata
Non-deterministic Finite Automata
Non-deterministic Finite Automata with instantaneous transitions
Finite Automata.
Languages recognized by finite automata
Regular expressions
Lexical Analysis
LEX
Introduction
LEX regular expressions
How the input is matched
More examples
The role of the lexical analyzer in the compiler
The design of an efficient lexical analyzer
Minimal automaton
About this document ...
Next:
Finite Automata
Marc Moreno Maza
2004-12-02
