Given the following grammar G = (V, T, S, P) where S is the starting symbol.
(1) S → aS
(2) S → aD
(3) D → bD
(4) D → λ
(a) Give two strings of different lengths that are generated from G
(b) Give two strings that cannot be generated from G
(c) What is the language generated by G, that is L(G)
I have uploaded the images for answer.
Get Answers For Free
Most questions answered within 1 hours.