Theory of Computation
Quick practice
Question 1 of 5
Consider the below mentioned grammar G {N={S, X, Y}, ∑={a, b, d}, S start symbol, P is the productions }. Here, N is set of non-terminals and ∑ is set of terminal symbols. The productions are:
S-> XXY
XXY -> XaYa
ab -> ad
Xa -> ab
Select the correct option:
A
G is type 1 grammar
B
None of the above
C
G is type 2 grammar
D
G is type 0 grammar
Get unlimited practice with GATE - CSIT, DSAI & Interview Preparation subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go