Introduction to formal language theory and compilers.
Parsing of context-free languages
Equivalence between Finite Automata and Regular Expressions.
2 written examinations, one at the end of each term
The course exists in the following branches:
Course ID : 3MM1GC
The course is attached to the following structures:
You can find this course among all other courses.
Date of update January 15, 2017