2) Let L {a, b} * be the language corresponding to the regular expression bba(ab)*+(ab+ba*b)*ba A-...

 

Transcribed Image Text:

2) Let L {a, b} * be the language corresponding to the regular expression bba(ab)*+(ab+ba*b)*ba A- Generate the complete CFG for this and convert to CNF B- Show the NFA and DFA 3) Show that the CFG given by Is ambiguous. Sa | Sa | bss | Ssb | SbS 2) Let L {a, b} * be the language corresponding to the regular expression bba(ab)*+(ab+ba*b)*ba A- Generate the complete CFG for this and convert to CNF B- Show the NFA and DFA 3) Show that the CFG given by Is ambiguous. Sa | Sa | bss | Ssb | SbS