Přístupnostní navigace
E-application
Search Search Close
Course detail
FIT-IFJAcad. 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 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.
Links
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
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.
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 4 points have to be obtained for the programming part of the project.
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 17 points without a spare or correction term. Students solve one team project during the semester (28 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
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).