(a) Illustrate the algorithm to convert NFA to DFA with suitable exam…

Question

(a) Illustrate the algorithm to convert NFA to DFA with suitable example

(b) Show that whether the following is ambiguous. If the answer is 'Yes', then disambiguate it

Stat -> if cond then stat | if cond then stat else stat | other stat

(c) Discuss why some grammars are known as Non-Context Free Grammars. Explain with appropriate examples

Related pages

• Conversion of NFA to DFA — topic
• Compiler Design syllabus

More PYQs on Conversion of NFA to DFA

• (a) Explain the construction of a deterministic finite automaton from a non-deterministic one with an example. (b) Explain the algorithm to eliminate Left- Rec…