Course development and history
Select the semester and course offering above to get information from the correct course syllabus and course offering.
Formal languages, finite automata, context free grammars.
State, scope, extent, static and dynamic information, effects, mutability.
Basic operational semantics.
Abstraction mechanisms, modularity, contracts.
Types, invariants, program equivalence.
Tools for program analysis.
Examples of advanced features of programming languages.
After completion of the course, the student should be able to:
in order to
No information inserted
Programming, algorithms and datastructures correspoding to one of the courses DD1320, DD1321, DD1325, DD1327, DD1338, DD1339, DD1340, DD1341, DD1346 or ID1020.
Will be announced on the course web no later than 10 weeks before the start of the course.
A, B, C, D, E, FX, F
Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability. The examiner may apply another examination format when re-examining individual students.
Under special circumstances, other examination formats may be used.
In this course, the code of honor of the school is applied, see: http://www.kth.se/en/csc/utbildning/hederskodex
Passed laboratory assignments, thesis and examination
Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.
Computer Science and Engineering
DD2489 Compiler construction
Philipp Haller (firstname.lastname@example.org)
Grading criteria will be announced at the start of the course.
In this course, the EECS code of honor applies, see:http://www.kth.se/en/eecs/utbildning/hederskodex