Tag Archives: CS606 Assignment 1 Solution 2013

CS606 Compiler Construction Assignment 1 Solution Fall 2013

Question No 1:                                                                                                                     Marks 20 Given the regular expression ( ( a | b ) ( a | bb ) ) * a) Construct an equivalent NFA using the Thompson’s Constructions algorithm. (10 marks) b) Convert the NFA (constructed in part a) to a DFA. (10 marks) internet advertising