UGC Net Computer Science December 13 Paper 3 Page 3 Solved
21. Given the following statements :
S1 : The grammars S → asb | bsa |
ss | a and S → asb | bsa | a are not equivalent.
S2 : The grammars S → ss | sss |
asb | bsa | λ and S → ss | asb | bsa | λ are equivalent.
Which of the following is true ?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct.
(C) S1 is not correct and S2 is correct.
(D) Both S1 and S2 are not correct.
Answer B
Explanation :-
Explanation :-