Context-Free Grammar: Language Generated by CFG

Computer Sciences > Gate 2017 Set-1 > CFG

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 of the following represents the language generated by the above grammar?

{(ab)ⁿ(cb)ⁿ | n >= 1 }

{(abⁿcb^m₁cb^m₂...cb^m_n | n, m1, m2, ....., mn >= 1 }

{(ab)ⁿ(cb^m)ⁿ | n >= 1 }

{(ab)ⁿ(cbⁿ)^m | m, n >= 1 }

Correct : b

Similar Questions