Which of the following is the correct representation of grammar for the given regular expression? a(aUb)*b
(a) (1) S → aMb (2) M → e (3) M → aM (4) M → bM
(b) (1) S → aMb (2) M → Mab (3) M → aM (4) M → bM
(c) (1) S → aMb (2) M → e (3) M → aMb (4) M → bMa
(d) None of the mentioned
I had been asked this question in final exam.
My question is based upon DPDA and Context Free Languages in chapter Push Down Automata of Automata Theory