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

English

Number of ECTS credits

5

Mode of study

Not applicable.

Guarantor

prof. RNDr. Alexandr Meduna, CSc.

Department

Department of Information Systems (UIFS)

Offered to foreign students

Of all faculties

Learning outcomes of the course unit

Fundamental familiarity with the theory of formal languages. Ability of a compiler construction.

Prerequisites

Discrete mathematics. Basic programming skills.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Not applicable.

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

Not applicable.

Work placements

Not applicable.

Aims

Familiarity with formal languages and their models. Grasp of compiler construction.

Specification of controlled education, way of implementation and compensation for absences

 

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Basic literature

Meduna, A.: Formal Languages and Computation: Models and Their Applications. Taylor & Francis, New York, 2014. (EN)

Recommended reading

Meduna, A.: Elements of Compiler Design. Taylor & Francis, New York, 2008. (EN)
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

eLearning: currently opened course

Classification of course in study plans

  • Programme MIT-EN Master's 1 year of study, winter semester, compulsory

  • Programme IT-BC-1H Bachelor's

    specialization BCH , 1 year of study, winter semester, recommended course

Type of course unit

 

Lecture

26 hod., optionally

Teacher / Lecturer

prof. RNDr. Alexandr Meduna, CSc.
Ing. Zbyněk Křivka, Ph.D.

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

13 hod., compulsory

Teacher / Lecturer

Ing. Zbyněk Křivka, Ph.D.
prof. RNDr. Alexandr Meduna, CSc.

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

13 hod., compulsory

Teacher / Lecturer

Ing. Zbyněk Křivka, Ph.D.

Syllabus

The task is to implement a program which, given a composition of functions,transforms it to an equivalentmathematical expression. 

Elearning

eLearning: currently opened course