This course presents basic notions of Formal Language Theory and its application to compilation.
It focuses on basic constructions of grammars, automata and regular expressions, and details
the proofs and definitions by induction on the length of words or the structure of a regular expression.
Applications on compilation cover all questions of translation from one language to another.
It will present practice of various aspects of compilation and application of
classical algorithms for code optimization.
Teaching : 40h Lecture + 60h practical work
Examination : practical work + final exam
Lecturer : Géraud Sénizergues