Formal Languages and Compilers
IFJ Acad. year 2020/2021 Winter semester 5 credits
This course discusses formal languages and their models. Based on these models, it explains the construction of compilers. The lectures are organized as follows: (I) Basic notions: formal languages and their models, grammars, automata; compilers. (II) Regular languages and lexical analysis: regular languages and expressions, finite automata and transducers, lexical analyzer; Lex; symbol table. (III) Context-free languages and syntax analysis: context-free grammars, pushdown automata and transducers, deterministic top-down syntax analysis (recursive descent), the essence of deterministic bottom-up syntax analysis; Yacc. (IV) Semantic analysis and code generation: semantic checks, intermediate code generation, optimization, code generation.
Language of instruction
Dvořák Tomáš, Ing. (DIFS FIT BUT)
Honzík Jan M., prof. Ing., CSc. (DIFS FIT BUT)
Jeřábek Kamil, Ing. (DIFS FIT BUT)
Klobučníková Dominika, Ing. (DIFS FIT BUT)
Koutenský Michal, Ing. (DIFS FIT BUT)
Kövári Adam, Mgr. (DIFS FIT BUT)
Křena Bohuslav, Ing., Ph.D. (DITS FIT BUT)
Křivka Zbyněk, Ing., Ph.D. (DIFS FIT BUT)
Regéciová Dominika, Ing. (DIFS FIT BUT)
Tomko Martin, Ing. (DIFS FIT BUT)
Zobal Lukáš, Ing. (DIFS FIT BUT)
Course Web Pages
Subject specific learning outcomes and competences
Fundamental familiarity with the theory of formal languages. The ability of a compiler construction.
Familiarity with formal languages and their models. Grasp of compiler construction.
Why is the course taught
The IFJ class gives a clear, comprehensive introduction to formal language theory and its applications in computer science for undergraduate students. It covers all rudimental topics concerning formal languages and their models, especially grammars and automata, and sketches the basic ideas underlying the theory of computation, including computability and decidability. Emphasizing the relationship between theory and application, the class describes many real-world applications, including computer science engineering techniques for language processing and their implementation.
More specifically, IFJ
- Covers the theory of formal languages and their models, including all essential concepts and properties
- Explains how language models underlie compilers
- Pays a special attention to programming language analyzers, such as scanners and parsers, based on four language models-regular expressions, finite automata, context-free grammars, and pushdown automata
- Discusses the mathematical notion of a Turing machine as a universally accepted formalization of the intuitive notion of a procedure
- Covers the general theory of computation, particularly computability and decidability
In short, this class represents a theoretically oriented treatment of formal languages and their models with a focus on their applications. It introduces all formalisms concerning them with enough rigor to make all results quite clear and valid. Every complicated mathematical passage is preceded by its intuitive explanation so that even the most complex parts of the class are easy to grasp. After taking this class, students should be able to understand the fundamental theory of formal languages and computation, write compilers, and confidently follow the most advanced books on the subject.
Prerequisite kwnowledge and skills
Knowledge of discrete mathematics.
- copy of lectures
- Meduna, A.: Automata and Languages. London, Springer, 2000.
- Meduna, A.: Elements of Compiler Design. New York, US, Tailor & Francis, 2008.
- Meduna, A.: Formal Languages and Computation. New York, Taylor & Francis, 2014.
- Parsons, T. W.: Introduction to Compiler Construction. Freeman, New York, 1992.
Syllabus of lectures
- Formal languages.
- Translation of languages and the structure of a compiler.
- Regular languages and their models: regular expressions and finite automata.
- Lexical analysis: lexical analyzer; Lex; symbol table.
- Context-free languages and their models: context-free grammars and pushdown automata.
- Syntax analysis: deterministic syntax analysis, FIRST and FOLLOW, LL grammars.
- Deterministic top-down syntax analysis: recursive descent.
- Deterministic bottom-up syntax analysis: simple precedence analysis; Yacc.
- Semantic analysis and intermediate form generation.
- Code generation.
- Chomsky hierarchy and the corresponding models.
- Remarks and summary. Preliminary discussion of the VYPe contents.
Syllabus - others, projects and individual work of students
Students in teams (3 through 4 students per a team) implement a compiler/interpreter of a simple programming language (including a documentation).
There is a midterm test for 20 points without a spare or correction term. Students solve one team project during the semester (25 points) that is handed over before given deadline.
Final written examination (55 points): The minimal number of points which can be obtained from the final written examination is 20. Otherwise, no points will be assigned to a student.
In case of a serious obstacle (e.g. illness), the student should inform the faculty about that and subsequently provide the evidence of such an obstacle.
- The midterm test takes place approximately in the middle of the semester without a spare or correction term (20 points). If student cannot attend the midterm test, (s)he can ask to derive points from the evaluation of his/her first attempt of the final exam. To enter the final exam in this case, at least 12 points from project are required.
- To apply theoretical knowledge, students work on a team project (25 points). Continuously, the team leader checks the team's progress. In case of illness of the most team members, the team can ask the responsible teacher to extend the time for the project.
- Finally, there is a final exam with two correction terms (55 points).
To be allowed to take the final written exam, the student has to obtain 20 points during the semester; out of these 20 points, at least four points have to be obtained for the programming part of the project.
|Mon||exam||2021-01-18||A112 A113 C228 L314 M103 M104 M105 N103 N104 N105 N203 N204 N205 O204||08:00||10:50||2BIA 2BIB 3BIT||řádná|
|Mon||exam||2021-01-18||C228 L314 M103 M104 M105 N103 N104 N105 N203 N204 N205 O204||14:00||15:50||2BIA 2BIB 3BIT||řádná|
|Mon||exam||2021-01-18||A113 C228 D0206 D0207 D105 L314 M103 M104 M105 N103 N104 N105 N203 N204 N205 O204||16:00||17:50||2BIA 2BIB 3BIT||řádná|
|Mon||exam||2021-01-18||C228 D0206 D0207 D105 L314 M104 N104 N105 N203 O204||18:00||19:50||2BIA 2BIB 3BIT||řádná|
|Wed||lecture||lectures||E104 E105 E112||11:00||13:50||2BIA 3BIT||xx|
|Wed||lecture||2., 3., 4., 5., 6., 7., 8., 9., 10., 11., 12., 13. of lectures||E112v||11:00||13:50||YT, ZP|
|Thu||lecture||2., 3., 4., 5., 6., 8., 9., 10., 11., 12., 13. of lectures||D105v||08:00||10:50||YT, ZP|
|Thu||exam||2021-01-28||A112 A113 A218 C228 D0206 D0207 D105 E104 E112 G108 G202 L314 M103 M104 M105 N103 N104 N105 N203 N204 N205 O204||09:00||11:50||2BIA 2BIB 3BIT||1. oprava|
|Fri||exam||2021-02-05||C228 D0206 D0207 D105 E104 E105 E112 G108 G202||14:00||16:50||2BIA 2BIB 3BIT||2. oprava|
Course inclusion in study plans