Course detail
Formal Languages and Compilers
FIT-IFJAcad. year: 2018/2019
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
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
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 has to be obtained for the programming part of the project.
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
- 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 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 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).
Recommended optional programme components
Prerequisites and corequisites
- recommended prerequisite
Discrete Mathematics
Basic literature
Recommended reading
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.
Classification of course in study plans
Type of course unit
Lecture
Teacher / Lecturer
Syllabus
- 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.
- Optimization.
- Code generation.
- Chomsky hierarchy and the corresponding models.
- Remarks and summary. Preliminary discussion of the VYPe contents.
Project
Teacher / Lecturer
Syllabus