- Knowledge of the properties of the different classes of formal languages (phrase-structure, context-sensitive, context-free, regular languages) - Knowledge of the properties of the different formalisms (grammars and automata) used to represent languages, and of the main related algorithms - Skill to represent a given language by means of grammars and automata and to solve simple problems about languages - Knowledge of the phases composing the translation process of a programming language: lexical analysis, syntax analysis, semantic analysis, intermediate code generation, generation and optimization of the target code - Knowledge of the design techniques and tools available for the implementation of scanners (lexical analyzers), parsers (syntax analyzers), and syntax-directed translators - Skill to design and implement syntax-directed translators for formal languages, by means of scanner and parser generators

The following knowledge is required: - Knowledge of basic concepts from the set theory: set operations, constructions and relations - Knowledge of the architecture of computer systems: processor structure and memory organization - Knowledge of the properties of programming languages and programming techniques - Knowledge of data structures (hash tables, trees, graphs) and their fundamental algorithms - Skill to develop programs in the Java language

Formal Languages (18 hours): - Classification - Regular languages (Regular grammars, Regular expressions, Finite state automata) and their application - Context-free languages (Context-free grammars, Pushdown automata, LR(k) grammars, LL(k) grammars) and their application - Turing machines and their application Compilers (42 hours): - Compiler structure - Lexical analysis - Syntax analysis (Bottom-up analysis, Top-down analysis) - Syntax-directed translation (Attribute definitions, Bottom-up translators) - Semantic analysis and intermediate code generation (Type control, Intermediate languages, Analysis of declarations and instructions)

This course has many practical and theoretical implications on a number of computer engineering activities, not only related to programming languages and compilers. On the one hand, formal languages and automata theory are the foundations of many applications such as formal verification, intrusion detection, modeling, etc. On the other hand, compilers and translators are used today inside many software applications, especially those using domain-specific languages to manage their operation. Examples are simulators, robotics and quantum computing applications, and all applications providing Command Line Interfaces (CLI).

Lectures (39 hours): - Formal Languages (18 hours) - Compilers (21 hours) Classroom practice (10.5 hours): - Generation of lexical analyzers by means of JFlex - Generation of syntax-directed translators by means of Cup Laboratory practice (10.5 hours): - Implementation of compiler components by means of JFlex and Cup

Books: - J.E. Hopcroft, R. Motwani, J.D. Ullman - Introduction to Automata Theory, Languages, and Computation 3rd Edition, Pearson - Addison-Wesley, 2007 - A.V. Aho, M.S. Lam, R. Sethi, J.D. Ullman - Compilers: Principles, Techniques, and Tools, 2nd Edition, Pearson - Addison-Wesley, 2007 Materials available on the teaching Web site Slides used in classroom Video-recording of lectures and practice.

Exam: Written test; Optional oral exam; Practical lab skills test;

Two written examinations have to be passed, either in the same call or in different calls of the same academic year. The theory test, lasting 40 minutes, is about the topics presented in the lectures. Its aim is to check that the student has acquired the expected knowledge (see expected learning outcomes). It may consist of open and closed questions as well as short exercises. No material can be consulted during this test and use of any electronic device is forbidden. The practice test, lasting 90 minutes, aims at checking that the student has acquired the expected skills (see expected learning outcomes). It consists in the development of a translator using JFlex and Cup in the Lab. Any kind of material can be consulted during this test, but access to the internet is forbidden during the test. After the end of the practice test, each participant must produce a complete and running version of their program, and send it to the lecturer within 3 working days. The final mark is the arithmetic mean of the marks of both tests (the two tests are equally weighted and both marks are expressed in the range 0-30 with the possibility of laude). Laude in the final mark is assigned if both tests have been passed with laude or if one has been passed with laude and the other one with 30. An oral exam will be requested by the teachers only in case of doubts about the evaluation of the theory or practice test. The oral exam will consist of extra questions or exercises aiming at resolving the doubts the teachers had in the evaluation. The students have the possibility to request the assignment of a project which substitutes the practice test. Sample exam texts for both tests will be provided to the students.

In addition to the message sent by the online system, students with disabilities or Specific Learning Disorders (SLD) are invited to directly inform the professor in charge of the course about the special arrangements for the exam that have been agreed with the Special Needs Unit. The professor has to be informed at least one week before the beginning of the examination session in order to provide students with the most suitable arrangements for each specific type of exam.