GATE Computer Science (CS) 2017 Shift 1 Solved Paper
© examsiri.com
Question : 20 of 65
Marks:
+1,
-0
Consider the following context-free grammar over the alphabet ∑ = {a, b, c} with S as the start symbol:
S → abScT | abcT
T → bT | b
Which one of the following represents the language generated by the above grammar?
S → abScT | abcT
T → bT | b
Which one of the following represents the language generated by the above grammar?
Go to Question: