Haskell Programming: Simply answer the question (Code)

4. [10 points] Use the algorithm in section 2.8.2 of Algorithms for Compiler Design to convert the regular expression ( (blc) la (a|c))*into a nondeterministic finite automaton. (You can drop redundant transitions, if you like, but you're not required to.) By the way, the weird expression at the top of the table in 2.8.2 is not the same as the expression e; expression p is for the empty regular expression (which doesn't come up very often) 2.8.2 Regular Expression A regular expresso s a nota on o re ular se Hence, every regular eo ress on there exists specitying LiM). Regular expressions and the regular sets they specify are shown in the tolowing table. in e automata hata e te the language eched b the regular express on Sim y to everyti e aut ata there e ses a regula e ore notation Regular expression Regular Se C) Start Start a in is a regular expression Scart or ris a regular expression, Ri u R here R and R2 are regular sets correeponding to r and f, respectively) Start where N is a finite automata accepting Ri, and2 is a finamala accepting R2 f1.2 is a regular expreseion, 1.R2 (Where R, and R2 are regular sete corresponding to and r2. respective 2. respecih Start where 1 is a finite automata accepting Ri. and Nz is finite automata acceptng R2 r is a reguler expression, R(where R is a regular set corresponding to Scart where N is a tinite automete 4. [10 points] Use the algorithm in section 2.8.2 of Algorithms for Compiler Design to convert the regular expression ( (blc) la (a|c))*into a nondeterministic finite automaton. (You can drop redundant transitions, if you like, but you're not required to.) By the way, the weird expression at the top of the table in 2.8.2 is not the same as the expression e; expression p is for the empty regular expression (which doesn't come up very often) 2.8.2 Regular Expression A regular expresso s a nota on o re ular se Hence, every regular eo ress on there exists specitying LiM). Regular expressions and the regular sets they specify are shown in the tolowing table. in e automata hata e te the language eched b the regular express on Sim y to everyti e aut ata there e ses a regula e ore notation Regular expression Regular Se C) Start Start a in is a regular expression Scart or ris a regular expression, Ri u R here R and R2 are regular sets correeponding to r and f, respectively) Start where N is a finite automata accepting Ri, and2 is a finamala accepting R2 f1.2 is a regular expreseion, 1.R2 (Where R, and R2 are regular sete corresponding to and r2. respective 2. respecih Start where 1 is a finite automata accepting Ri. and Nz is finite automata acceptng R2 r is a reguler expression, R(where R is a regular set corresponding to Scart where N is a tinite automete