Faculty of Information Technology, BUT

Course details

Principles of Compiler Design

ZAP Acad. year 2004/2005 Summer semester 6 credits

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: intermediate code generation, optimization, code generation.

Guarantor

Language of instruction

Czech, English

Completion

Examination (written)

Time span

39 hrs lectures, 12 hrs exercises, 14 hrs projects

Assessment points

55 exam, 20 half-term test, 25 projects

Department

Lecturer

Instructor

Bidlo Radek, Ing. (DIFS FIT BUT)
Blatný Petr, Ing. (DIFS FIT BUT)
Kaláb Petr, Ing. (DIFS FIT BUT)
Kolář Dušan, doc. Dr. Ing. (DIFS FIT BUT)
Kopeček Tomáš, Ing. (DIFS FIT BUT)
Křivka Zbyněk, Ing., Ph.D. (DIFS FIT BUT)
Lorenc Luboš, Ing., Ph.D. (DIFS FIT BUT)
Lukáš Roman, Ing., Ph.D. (DIFS FIT BUT)
Meduna Alexander, prof. RNDr., CSc. (DIFS FIT BUT)
Škrkal Oto, Ing. (DIFS FIT BUT)
Vítek Martin, Ing., Ph.D. (DIFS FIT BUT)

Subject specific learning outcomes and competences

Ability of a compiler construction.

Learning objectives

Grasp of compiler construction.

Prerequisites

Study literature

  • copy of lectures
  • Meduna, A.: Automata and Languages. London, Springer, 2000.

Fundamental literature

  • Parsons, T. W.: Introduction to Compiler Construction. Freeman, New York, 1992.

Syllabus of lectures

  • Introduction.
  • Lexical analysis: theory; regular expressions and finite automata.
  • Lexical analysis: lexical analyzer; Lex; symbol table.
  • Syntax analysis: theory; context-free grammars and pushdown automata.
  • Syntax analysis: principles.
  • Syntax analysis: deterministic syntax analysis, FIRST and FOLLOW, LL and LR grammars.
  • Deterministic top-down syntax analysis: recursive descent.
  • Deterministic bottom-up syntax analysis: simple precedence analysis, LR analysis; Yacc.
  • Semantic analysis and intermediate form generation.
  • Intermediate form generation.
  • Optimazation.
  • Code generation.
  • Conclusion.
Back to top