FI:PV103 Compilers for CS - Course Information
PV103 Compilers for CS
Faculty of InformaticsAutumn 2003
- Extent and Intensity
- 2/1. 3 credit(s) (plus extra credits for completion). 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
- prof. PhDr. Karel Pala, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics
Contact Person: doc. RNDr. Václav Sedláček, CSc. - Timetable
- Thu 11:00–13:50 B007
- Prerequisites
- ! P103 Compilers for CS
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
- Applied Informatics (programme FI, B-AP)
- Applied Informatics (programme FI, N-AP)
- Informatics (programme FI, B-IN)
- Informatics (programme FI, N-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, N-SS)
- Course objectives
- Compiler structure, compiler functions, and compiler construction are classical issues of informatics. The aim is to present the ways of applications of knowledge from the theory of formal languages and the theory of automata into real systems.
- 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
- Literature
- Sylaby přednášek
- Language of instruction
- Czech
- Further Comments
- The course is taught annually.
- Enrolment Statistics (Autumn 2003, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2003/PV103