Course detail
Formal Languages and Compilers (in English)
FIT-IFJeAcad. year: 2022/2023
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, lexical analyzer; symbol table. (III) Context-free languages and syntax analysis: context-free grammars, pushdown automata, deterministic top-down syntax analysis (recursive descent), the essence of deterministic bottom-up syntax analysis. (IV) Semantic analysis and code generation: intermediate code generation, optimization, code generation.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Offered to foreign students
Learning outcomes of the course unit
Prerequisites
Discrete mathematics. Basic programming skills.
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
- Mid-term exam - 20 points.
- Project - 25 points.
- Final exam - 55 points. To be allowed to take the final exam, the student has to obtain 20 points during the semester; out of these 20 points, at least five points have to be obtained from the project.
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
- recommended prerequisite
Discrete Mathematics
Basic literature
Recommended reading
Nystrom, R.: Crafting Interpreters. Genever Benning, 2021, Available online http://craftinginterpreters.com. (EN)
Parsons, T. W.: Introduction to Compiler Construction. Freeman, New York, 1992. (EN)
Elearning
Classification of course in study plans
Type of course unit
Lecture
Teacher / Lecturer
Syllabus
- Basics of formal languages: alphabet, strings, languages.
- Introduction to compiler design: structure of a compiler.
- Regular languages and their models: regular expressions, finite automata.
- Variants of finite automata.
- Lexical analysis: lexical analyzer, symbol table.
- Context-free languages and their models: context-free grammars, pushdown automata.
- Pushdown automata and general parsing.
- Deterministic top-down syntax analysis: recursive descent.
- Deterministic bottom-up syntax analysis: simple precedence analysis.
- Chomsky hierarchy and the corresponding models. Remarks and summary.
Fundamentals seminar
Teacher / Lecturer
Syllabus
- Basics of formal languages: alphabet, strings, languages.
- Introduction to compiler design: structure of a compiler.
- Regular languages and their models: regular expressions, finite automata.
- Variants of finite automata.
- Lexical analysis: lexical analyzer, symbol table.
- Context-free languages and their models: context-free grammars, pushdown automata.
- Pushdown automata and general parsing.
- Deterministic top-down syntax analysis: recursive descent.
- Deterministic bottom-up syntax analysis: simple precedence analysis.
- Chomsky hierarchy and the corresponding models. Remarks and summary.
Project
Teacher / Lecturer
Syllabus
Elearning