Each use of $S \rightarrow abScT$ adds "ab" at the front and "$cT$" at the back, and the last step uses $abcT$. After $n$ steps the string is $(ab)^n$ followed by $n$ blocks of the form $c\,b^{m}$, where each $T$ gives one or more $b$'s independently. So the language is $(ab)^n c b^{m_1} c b^{m_2} \cdots c b^{m_n}$ with all $m_i \geq 1$.
More Context-Free Grammars and Pushdown Automata questions
GATE 2017 CS (CS1) Q44– If G is a grammar with productions S SaS aSb bSa SS where S is the start variable, then…
GATE 2017 CS (CS1) Q47– Consider the context-free grammars over the alphabet \a, b, c\ given below. S and T are…
GATE 2014 CS (CS3) Q46– Over =\0,1,c\, let L 1=\0n1n:n0\, L 2=\wcwr:w\0,1\*\, L 3=\wwr:w\0,1\*\, where wr reverses…
GATE 2017 CS (CS2) Q26– With start S and rules S→XY, X→aX a, Y→aYb ε, identify the language.
GATE 2010 CS Q50– For nonnegative i,j, let L 1=\0i1j:i j\, L 2=\0i1j:i=j\, L 3=\0i1j:i=2j+1\ and L…
GATE 2015 CS (CS3) Q44– Which languages are context-free? L 1=\ambnanbm:m,n1\; L 2=\ambnambn:m,n1\; L…