P103 Compilers for CS

Faculty of Informatics
Autumn 1998
Extent and Intensity
2/1. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. RNDr. Václav Sedláček, CSc. (lecturer)
Guaranteed by
Contact Person: doc. RNDr. Václav Sedláček, CSc.
Prerequisites
( U111 Design of Algorithms for CS II || I002 Design of Algorithms I )&& P001 Operating Systems && I005 Formal Languages and Automata I
Pre-requisities: U110 U111 Design of Algorithms for CS II U210 Design of Algorithms for CS III p001 and I005 Formal Languages and Automata I
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Introduction to compiler construction, compiler structure, the aims of compilation, compilation and interpretation.
  • lexical analysis and their purposes, lexical analyzer construcion
  • Syntactic analysis, syntactic analyzer design and construcion
  • translating and attribute grammars, how to construct syntactic analyzer using translating and attribute grammars, syntactic and semantics stacks
  • semantics analysis, data types, type control, block structure languages
  • memory structure and memory scheduling, static and dynamic memory, stack and heap
  • internal form of source code, types of internal forms of source code and methods of internal code generation
  • object code generation, memory scheduling
  • error detection and error recovery
  • code optimalization
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Autumn 1999, Autumn 2000, Autumn 2001.
  • Enrolment Statistics (Autumn 1998, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn1998/P103