At each step the grammar can add either an $a$ or a $b$ in front, in any order, and then stop with $\epsilon$. So it generates every string over $\{a, b\}$, which is $\{a, b\}^*$.
More Context-Free Grammars and Pushdown Automata questions
GATE 2016 CS (CS1) Q52– Consider the following context-free grammars: G 1: S aS B, B b bB G 2: S aA bB, A aA B , B…
GATE 2016 CS (CS1) Q53– Consider the transition diagram of a PDA given below with input alphabet = \a, b\ and…
GATE 2017 CS (CS1) Q20– Consider the following context-free grammar over the alphabet = \a, b, c\ with S as the…
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…