Question: Compiler Design. please help me. (a) Draw NFA from the following regular expressions. 0+ (OU 1) 1+ A(B*D)C|PQ R ii. (b) Convert the following NFA

Compiler Design. please help me.
(a) Draw NFA from the following regular expressions. 0+ (OU 1) 1+ A(B*D)C|PQ R ii. (b) Convert the following NFA in Fig. 1 into a DFA using subsct construction method. b b a (e ) Fig. 1. NFA for Q2(b) For each of the following strings, draw the path and determine whether it is recognized by the output DFA of Q2(b) or not. 1. aabbaaaa in. bbaabbab a abba IM bab
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
