Question

Which of the following are context free language?

(a) L={a^ib^i|i>=0}

(b) L={ww^r| w is a string and r represents reverse}

(c) Both (a) and (b)

(d) one of the mentioned

The question was posed to me by my school teacher while I was bunking the class.

My enquiry is from DPDA and Ambiguous Grammars topic in chapter Push Down Automata of Automata Theory

Answer 1

Right choice is (a) L={a^ib^i|i>=0}

To elaborate: None.