"Babes-Bolyai" University of Cluj-Napoca
Faculty of Mathematics and Computer Science

Formal languages and compiler design methods
Code
Semes-
ter
Hours: C+S+L
Credits
Type
Section
MI062
4
2+0+2
6
compulsory
Matematica Economica
MI062
4
2+0+2
6
compulsory
Matematici Aplicate
Teaching Staff in Charge
Lect. MOTOGNA Simona Claudia, Ph.D., motogna@cs.ubbcluj.ro
Lect. ROBU Judit, robu@cs.ubbcluj.ro
Aims
To know how a compiler is functioning, and the compilations steps. It is also necessary to gain knowledge in the formal support of the compilation steps, meaning formal languages theory: grammars, automata, equivalences between grammar generated languages and automata accepted languages.
Content
To know how a compiler is functioning, and the compilations steps. It is also necessary to gain knowledge in the formal support of the compilation steps, meaning formal languages theory: grammars, automata, equivalences between grammar generated languages and automata accepted languages.
References
1. J.E. Hopcroft, J.D. Ullman - Introduction to Automata Theory, Languages and Computation, Addison Wesley, 1979.
2. L.D. Serbanati - Limbaje de programare si compilatoare, Ed. Academiei RSR, 1987.
3. A.V. Aho, D.J. Ullman - Principles of computer design, Addison-Wesley, 1978.
4. A.V. Aho, D.J. Ullman - The theory of parsing, translation and compiling, Prentice-Hall, Engl. Cliffs., N.J., 1972, 1973.
5. D. Gries - Compiler construction for digital computers,, John Wiley, New York, 1971.
6. G. Moldovan, V. Cioban, M. Lupea - Limbaje formale si automate. Culegere de probleme, Univ. "Babes-Bolyai", Cluj-Napoca, 1996.
Assessment
The final grade will reflect the seminar and lab activity and the knowledge obtained by the students.
The final mark will be compute from: 20% lab_mark + 20% seminar_mark + 60% exam_mark.
The seminar_mark will be establish from the weekly homeworks.