The student will be able to :
- recognize problems that can be analyzed using regular expressions, context-free grammars, attribute grammars ;
- formalize the problem and use software tools to execute this formalization (e.g. build a small compiler).
Learn the basics of computer language processors: compilers, interpreters and the associated language theory.
A syllabus of exercises will be used:
Course of lectures (ex-cathedra). Exercises. A large assignment: building a small compiler (2nd semester). The compiler is (partially) evaluated by automated testing.
Written exam (60%). Evaluation of the large assignment (40%).
| Training | Study programme | Block | Credits | Mandatory |
|---|---|---|---|---|
| Additional teaching units for the master's degree in computer science (staggered timetable) (870P) | Standard | 0 | 10 | |
| Additional teaching units for the master's degree in computer science (staggered timetable) (870P) | Standard | 1 | 10 |