After successful completion of the course, students are able to explain the algorithms which have been presented during the lecture in a way that everybody can understand them and solve problems using the presented algorithms.
intermediate representations, optimizations, register allocation, instruction selection, instruction scheduling, integrated register allocation instruction scheduling, software pipelining, code generator generators
Lecture and autonomous learning from the English lecture notes
homepage
written solving of the exam problems and aural exam explaining theory
Not necessary
compilers
