Přístupnostní navigace
E-application
Search Search Close
Course detail
FIT-IFJAcad. year: 2023/2024
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
Number of ECTS credits
Mode of study
Guarantor
Department
Entry knowledge
Knowledge of discrete mathematics.
Rules for evaluation and completion of the course
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. Exam prerequisites: 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.
In case of a serious obstacle (e.g. illness), the student should inform the faculty about that andsubsequently provide the evidence of such an obstacle.
Aims
Familiarity with formal languages and their models. Grasp of compiler construction.Fundamental familiarity with the theory of formal languages. The ability of a compiler construction.
Study aids
Prerequisites and corequisites
Basic literature
Recommended reading
Elearning
Classification of course in study plans
branch BIT , 2 year of study, winter semester, compulsory
Lecture
Teacher / Lecturer
Syllabus
Project
Students in teams (3 through 4 students per a team) implement a compiler of a simple programming language (including a documentation and oral defense).