FR
EN
Théorie des LangagesPrincipes de la programmation (STI)
Language Theory
Teaching unit Programming Principles · S05T_INF1 | EC Code S05T_INF1-9
12ECTS (EU)
1Coefficient
21:20Hours
Séquencement
↳ Berthome Pascal
↳ Hugot Vincent
Bloc incomplet : le nombre de séances planifiées ne correspond pas à la fiche.
Learning objectives
- Give the theoretical tools to understand the first two phases of the program compilation (lexical analysis and syntax analysis),
- Bringing the notions of hierarchy of languages
Program
- Basic language definitions and concepts,
- Operations on languages,
- The deterministic and non-deterministic finite automatons,
- Equivalence between regular languages and AFD,
- Minimum automation,
- Algebraic grammar,
- Concept of statistical analysis.
- Handling of a syntax analyser
Assessment
- Final review
References
- J. Hopcroft, M. Rajeev, J. Ullman, Introduction to Automata Theory, Languages, and Computation (3rd Ed), Pearson, 2013
Skills
5| Ref. | Verb | Description | Level |
|---|---|---|---|
| C2_1 | calculate | Apply automata transformation algorithms | 2 |
| C2_1 | illustrate | Build simple automatons and grammars | 2 |
| C2_1 | solve | How to apply general theorems | 2 |
| C2_2 | list | Know the compilation phases | 1 |
| C2_3 | calculate | Use a syntax and grammatical analyser | 2 |