05 06 2025 E TS

Page 1

FORMAL LANGUAGES AND COMPILERS prof.s Giovanni Agosta, Luca Breveglieri and Daniele Catta neo Exam of THU 5 JUNE 2025 – Theory Part WITH SOLUTIONS – FOR TEACHING PURPOSES THE SOLUTIONS ARE WIDEL Y COMMENTED 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 CAREFULL Y: • 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: Theory syntax 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 exercis es × 5 points) 4) bonus question (1 exercise × 5 points) Lab compiler design by Flex and Bison (25% of the final grade) 1) basic questions (30 points) 2) bonus question (5 points) • For the theory part to be valid, the candidate must achieve a g rade of at least 5 /10 in each of the three sections 1, 2 and 3. If this is not the case, section 4 is not evaluated. Section 4 has no threshold on its own. Correctly answering all the questio ns in sections 1, 2 and 3 allows the candidate to achieve a grade of 30 /30 (but not cum laude ) for the theory part. • For the lab part to be valid, the candidate must achieve a grad e of at least 15 /30 in the basic questions. The…