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?
- A.
{(ab)n(cb)n∣n≥1}
- B.
{(ab)ncbm1cbm2...cbmn∣n,m1,m2,...,mn≥1}
- C.
{(ab)n(cbm)n∣m,n≥1}
- D.
{(ab)n(cbn)m∣m,n≥1}
Attempted by 124 students.