Document information
- University
- Politecnico di Milano
- Degree programme
- Computer Engineering
- Subject
- Formal Languages and Compilers
- Academic year
- 2024-2025
- Classification
- Exam · Full exam
- Content
- Exam paper only
- Original format
- Text
- Searchable text
Full exam for Formal Languages and Compilers in the Computer Engineering degree programme at Politecnico di Milano. The document covers: FORMAL LANGUAGES AND COMPILERS prof.s Giovanni Agosta, Luca Breveglieri and Daniele Cattaneo Exam of THURSDAY 5 JUNE 2025 – Laboratory Part WITH SOLUTIONS LAST NAME (SURNAME) + FIRST NAME: (capital letters please) MATRICOLA: SIGNATURE: (or PERSON CODE) TEACHER: □ Prof. G. AGOSTA
Full exam for Formal Languages and Compilers in the Computer Engineering degree programme at Politecnico di Milano. The document covers: FORMAL LANGUAGES AND COMPILERS prof.s Giovanni Agosta, Luca Breveglieri and Daniele Cattaneo Exam of THURSDAY 5 JUNE 2025 – Laboratory Part WITH SOLUTIONS LAST NAME (SURNAME) + FIRST NAME: (capital letters please) MATRICOLA: SIGNATURE: (or PERSON CODE) TEACHER: □ Prof. G. AGOSTA
Import quality: text was extracted directly from the original document.
Representative passages recognised in different parts of the material. The full extracted text remains available to search, while this compact preview makes the page easier to read.
FORMAL LANGUAGES AND COMPILERS prof.s Giovanni Agosta, Luca Breveglieri and Daniele Cattaneo Exam of THURSDAY 5 JUNE 2025 – Laboratory Part WITH SOLUTIONS LAST NAME (SURNAME) + FIRST NAME: (capital letters please) MATRICOLA: SIGNATURE: (or PERSON CODE) TEACHER: □ Prof. G. AGOSTA –□ Prof. L. BREVEGLIERI –□ Prof. D. CATTANEO INSTRUCTIONS – READ CAREFULLY: •The exam is open book: textbooks and personal notes are permitted. •Pencil writing is permitted, except on the cover page (this sheet). •Please write in the free space left and if necessary continue on the back side of the sheet; do not attach new sheets and do not replace the existing ones. •Time: lab part 1 h– theory part 2 h. SCORING AND GRADE ATTRIBUTION: •The exam is in written form and consists of two parts: Theorysyntax and semantics of languages, divided in four sections: (75%of the final grade) 1)regular expressions and finite automata (1 exercise×10 points) 2)syntax analysis and parsing methodologies (1 exercise×10 points) 3)grammar design – translation – semantic analysis (2 exercises×5 points) 4)bonusquestion (1 exercise×5 points) Labcompiler design by Flex and Bison (25%of the final grade) 1)basic questions (30 points) 2)bonusquestion (5 points) •For the theory part to be valid, the candidate must achieve a grade of at least5/10in each of the three sections1,2and3. If this is not the case, section4is not evaluated. Section4has no threshold on its own. Correctly answering all the questions in sections1,2and3allows the candidate to achieve a grade of30/30(but notcum laude) for the theory part. •For the lab part to be valid, the candidate must achieve a grade of at least15/30in the basic questions. The bonus question is evaluated only if the threshold is reached. •To pass the exam, the candidate must succeed…
First page of the document.