Přístupnostní navigace
E-application
Search Search Close
Course detail
FIT-IFJeAcad. year: 2024/2025
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.
Links
Exam prerequisites
To be allowed to take the final exam, the student must obtain 20 points during the semester; out of these 20 points, at least 5 points must be obtained from the project.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Offered to foreign students
Entry knowledge
Rules for evaluation and completion of the course
Aims
Study aids
Prerequisites and corequisites
Basic literature
Recommended reading
Elearning
Classification of course in study plans
specialization BCH , 0 year of study, winter semester, recommended course
Lecture
Teacher / Lecturer
Syllabus
Project
The task is to implement and document a program which, given a composition of functions, transforms it to an equivalent mathematical expression.