. Given G = ({A, S}, (a, b }, S, P) with P, defined by the...

  

Transcribed Image Text:

. Given G = ({A, S}, (a, b }, S, P) with P, defined by the production rules: S aAb | 2 AaAb | (i). Show that L(G)= {a"b": n0}. (ii). Show that G is equivalent to G where G= ({S}, {a,b), S, P) where P is given by S aSb S1 Question 2. Compare and contrast Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA). Question 3. As a good compiler designer, find regular expressions over = {a, b} for the language L defined as follows: L= ambm>0}; and justify your answer. . Given G = ({A, S}, (a, b }, S, P) with P, defined by the production rules: S aAb | 2 AaAb | (i). Show that L(G)= {a"b": n0}. (ii). Show that G is equivalent to G where G= ({S}, {a,b), S, P) where P is given by S aSb S1 Question 2. Compare and contrast Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA). Question 3. As a good compiler designer, find regular expressions over = {a, b} for the language L defined as follows: L= ambm>0}; and justify your answer.