Course details

Formal Languages and Compilers

IFJ Acad. year 2003/2004 Winter semester 5 credits

Current academic year

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.

Details ...

Guarantor

Meduna Alexandr, prof. RNDr., CSc. (DIFS)

Language of instruction

Czech, English

Completion

Examination

Time span

Department

Department of Information Systems (UIFS)

Subject specific learning outcomes and competences

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

Learning objectives

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

Recommended prerequisites

Study literature

  • kopie přednášek (elektronické i papírové)
  • Meduna, A.: Automata and Languages. London, Springer, 2000.
  • Meduna, A.: Elements of Compiler Design. New York, US, Tailor & Francis, 2008.

Fundamental literature

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

Course inclusion in study plans

Back to top