Question

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

Answer 1

Correct option is (a) (1) S → aMb (2) M → e (3) M → aM (4) M → bM

Easy explanation: The basic idea of grammar formalisms is to capture the structure of string by

a) using special symbols to stand for substrings of a particular structure

b) using rules to specify how the substrings are combined to form new substrings.