Question 7682 – UGC-NET DEC-2019 Part-2
November 27, 2023Question 7687 – UGC-NET DEC-2019 Part-2
November 27, 2023Question 7684 – UGC-NET DEC-2019 Part-2
Consider the following grammar :
S→0A|0BB
A→00A| λ
B→1B|11C
C→B
Which language does this grammar generate?
Correct Answer: C
Question 21 Explanation:
Option 1 is incorrect because every string generated by given grammar will contain only 0’s and given option is generating string containing 1’s also.
Option 2 is incorrect because it can’t generate “000”.
Option 3 is correct because it generates string same as given grammar do.
Option 4 is incorrect because every string generated by given grammar will contain only 0’s and given option is generating string containing 1’s also.
Option 2 is incorrect because it can’t generate “000”.
Option 3 is correct because it generates string same as given grammar do.
Option 4 is incorrect because every string generated by given grammar will contain only 0’s and given option is generating string containing 1’s also.
L(00) * 0+(11)*1)
L(0(11)* + 1(00)*)
L((00)*0)
L(0(11) *1)
Subscribe
Login
0 Comments