
General Information:
Course: 2h/week
Lab work: 1h/week = 2h/2weeks
Credit points: 4
Laboratory:
Prerequisites:
"Objectoriented Programming" and "Formal Languages and Automata" courses
Grading and workload
Our grade in the course will be earned / calculated as follows:
 Homework 30% and frequency(c/l) 10%
 Final exam 60%
Homeworks will be given roughly every week or two, and will each consist of a small number of exercises. Grades may also be adjusted upward slightly based on regular, positive contributions to class discussions.
Examination Policy
The comprehensive exam consists of a written answer to a quiz and a closedbook, two hours test consisting in designing and implementing some compiler components.
Lecture notes: not available
Textbooks:
1. L. D. Serbanati, Limbaje si compilatoare, Ed. Academiei RSR, 1987.
2. A.V.Aho, M.S. Lam , R.Sethi,J.D.Ullman, Compilers: Principles, Techniques, and Tools, Addison Wesley, Second edition, 2007
3. D. E. Knuth. Semantics of Contextfree Languages. Mathematical Systems Theory, 2(2):127145. SpringerVerlag, 1968. (Corrigenda: Mathematical Systems Theory 5, 1, 1971, 9596.)


Schedule of Laboratory Topics and Homework
The lab assignments will require knowledge of materials covered by the course lectures.
Here you can find information on your work progress at this course.
Lab.# Week 
Homework Topic 




Lecture Schedule
Please note: 1.This schedule is subject to change 2. Look closely at this site for changes
Examinations
Exam Date 
Time/Room 
Wen,30 May 
Exam Redoing
BUCUR RAZVAN 4

Sat,1 Sept. 8:30
Room:CB105

ReExamination
Bucur Razvan 4

Fri,7 Sept.
13:00
Room: CB105

ReExamination


