15 01 19

Page 1

FORMAL LANGUAGES AND COMPILERS prof.s Luca Breveglieri and Angelo Morzenti Exam of Tue 15 JANUARY 2019 - Part Theory WITH SOLUTIONS - FOR TEACHING PURPOSES HERE THE SOLUTIONS ARE WIDEL Y COMMENTED LAST + FIRST NAME: (capital letters please) MATRICOLA: SIGNATURE: (or PERSON CODE) INSTRUCTIONS - READ CAREFULLY: • The exam is in written form and consists of two parts: 1. Theory (80%): Syntax and Semantics of Languages – regular expressions and finite automata – free grammars and pushdown automata – syntax analysis and parsing methodologies – language translation and semantic analysis 2. Lab (20%): Compiler Design by Flex and Bison • To pass the exam, the candidate must succeed in both parts (th eory and lab), in one call or more calls separately, but within one year (12 months ) between the two parts. • To pass part theory, the candidate must answer the mandatory (not optional) ques- tions; notice that the full grade is achieved by answering th e optional questions. • The exam is open book: textbooks and personal notes are permi tted. • 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 existin g ones. • Time: part lab 60m - part theory 2h.15m 1 Regular Expressions and Finite Automata 20% 1. Consider the nondeterministic finite-state automaton A below, over a two-letter al- phabet Σ = { a, b }: 1 2 3A → → a, b b b a, b Answer the following questions: (a) Find a deterministic version A′ of automaton A, by using the Berry-Sethi ( BS ) method. (b) By using a systematic method, determine whether the dete rministic automaton A′ is minimal, and if it is not so, find the equivalent minimal aut omaton. (c) By using a systematic method, find an automaton A that accepts language L, i.e., the set…