|
|
|
|
home · studies

| Compilers |
| Module Type: |
Information Technology Track |
| Module Code: |
736Î |
| Syllabus: |
Finite, deterministic and non-deterministic automata. Language recognition. Regular languages and context-free grammars.
Lexical analysis and parsing. Semantics and type checking. Intermediate languages. Memory registration. Garbage collection.
Special topics on compiling functional and object-oriented languages. Application of tools such as LEX, YACC in the implementation of a compiler. |
| Module Aims-Objectives: |
The investigation of simple automata (typical computational models) and their illustration via applied problems
like the implementation of compilers and the design of a programming language.
Upon completing this module students should be able to demonstrate aptitude in typical computation models,
basic types of automata and languages, and come in touch with the design and implementation of compilers via the laboratory sessions. |
| Bibliography: |
• Alfred V. Aho, et al, “Compilers: Principles, Techniques and Tools� Addison Wesley 1986
• Lecture Notes |
|
|
|
|
|
|
