"Babes-Bolyai" University of Cluj-Napoca
Faculty of Mathematics and Computer Science
| Formal languages and compiler design methods |
ter |
|||||||||
| Teaching Staff in Charge |
|
| Aims |
|
Grammars and languages; Chomsky hierarchy; regular grammars, finite automata and the equivalence between them; context-free grammars, push-down automata and their equivalence.
Compiler construction fundamentals: compiling phases, scanning, persing and code generation. |
| Content |
|
I. Grammars, languages, automata
Regular gramamrs and languages. Finite automata. Context free grammars and languages. Pushdown automata. Turing automta Special grammars - LR(k), LL(k) and precedence grammars II. Compilers Genaral problems of compiler contruction Lexical parsers Syntactical analyzers - ascendent and descendent methods Intermediar forms Code generation and optimization |
| References |
|
1. A.V. AHO, D.J. ULLMAN - Principles of computer design, Addison-Wesley, 1978.
2. A.V. AHO, D.J. ULLMAN - The theory of parsing, translation and compiling, Prentice-Hall, Engl. Cliffs., N.J., 1972, 1973. 3. D. GRIES - Compiler construction for digital computers,, John Wiley, New York, 1971. 4. SIPSER, M., Introduction to the theory of computation, PWS Pulb. Co., 1997. 5. G. MOLDOVAN, V. CIOBAN, M. LUPEA - Limbaje formale si automate. Culegere de probleme, Univ. Babes-Bolyai, Cluj-Napoca, 1996.,l http://math.ubbcluj.ro/~infodist/alf/INDEX.HTM 6. CSÖRNYEI ZOLTÁN, Bevezetés a fordítóprogramok elméletébe, I, II., ELTE, Budapest, 1996 7. L.D. SERBANATI - Limbaje de programare si compilatoare, Ed. Academiei RSR, 1987. 8. CSÖRNYEI ZOLTÁN, Fordítási algoritmusok, Erdélyi Tankönyvtanács, Kolozsvár, 2000. 9. DEMETROVICS JÁNOS-DENEV, J.-PAVLOV, R., A számítástudomány matematikai alapjai, Nemzeti Tankönyvkiadó, Budapest, 1999. |
| 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: 25% lab_mark + 75% exam_mark (icluding semnianr work too). |