Key words
Compiler, Interpreter, P170, P175, T120
Objectives
To gain insight in the structure of compilers, and the various techniques and algorithms used for them.
Some of those methods also have a wider applicability.
Topics
An introduction to the techniques used to translate programming languages (compilers and
interpreters):
- General structure of compilers and interpreters.
- Lexical analysis (regular expressions, introduction to automata).
- Syntactic analysis (context free grammars, recursive descent parsing, LL and LR parsing).
- Semantic analysis (attributes and their evaluation, attribute grammars).
- Run time systems and memory management.
- Introduction to intermediate codegeneration, optimization, and code generation.
Prerequisites
Final objectives of Algoritmen I.
Final Objectives
Compilers are very complex programs which have to solve the problems posed by modern
programming languages with the possibilities of modern processors and operating systems. They apply
techniques from various domains of computer science, like the theory of automata and formal
languages, complex algorithms and data structures. This course results in the following abilities:
- General scientific abilities [AWC1]: Ability to think in a critical, creative and scientific fashion.
- General technical abilities [ATC1]: Ability to make reasoned links between different scientific
domains in order to understand technical problems and processes.
- Specific abilities [SC10]: Ability to obtain knowledge and insight in present-day scientific
research in computer science.
Materials used
Handouts.
Study costs
Copy costs.
Study guidance
Lecturer is available by appointment.
Teaching Methods
Lectures.
Assessment
Oral examination.
Lecturer(s)
Rudy STOOP.
|
|
