Consider the following context free grammar over the alphabet a b c with S as the start symbol S abScT abcT T bT b gate computer science 2017

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
GATE-Computer-Science-Engineering-2017-->View question

Consider the following context-free grammar over the alphabet ∑ = {a, b, c} with S as the start symbol: S → abScT | abcT T → bT | b -gate computer science 2017

Which of the following represents the language generated by the above grammar ?
A) {(ab)n(cb)n | n >= 1 }
B) {(abncbm1cbm2...cbmn | n, m1, m2, ....., mn >= 1 }
C) {(ab)n(cbm)n | n >= 1 }
D) {(ab)n(cbn)m | m, n >= 1 }


Taged users:

Be first to like this question

Be first to dislike this question

Talk about thisDelete|Like|Dislike|


B) {(abncbm1cbm2...cbmn | n, m1, m2, ....., mn >= 1 }

Let’s generate a string from given grammar : S → abScT → ab abScT cT → abab abcT cTcT → abababc bT cTcT → abababcb bT cTcT → abababcbb bT cTcT → abababcbbbb cTcT → abababcbbbbc b cT → abababcbbbbcbc bT → abababcbbbbcbcbb This string can rule out all wrong options. Now let’s try to analyse this string. → abababcbbbbcbcbb → {(abncbm1cbm2...cbmn | n, m1, m2, ....., mn >= 1 } We can clearly rule out option (A), (C) and (D) with help of the string generated by given grammar. Only option (B) is correct.


Be first to like this answer

Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

Can you help us to add better answer here? Please see this

Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!