After successful completion of the course, students are able to explain the abstract machines and algorithms which have been presented during the lecture in a way that everybody can understand them and to design new abstract machines.
real machines, processor architectures, structure of interpreters, intermediate representations, threaded, code, Forth, Java VM, syntax directed editors, Prolog interpreters, implementation of functional languages, abstract machines (P4, JVM, tree machines, Dalvik, WAM, VAM, SECD).
Lecture and autonomous learning from the English lecture notes
see homepage
aural exam
Not necessary
Compiler Construction