State true or false:
Statement: Every context free grammar can be transformed into an equvalent non deterministic push down automata.
(a) Statement: Every context free grammar can be transformed into an equvalent non deterministic push down automata.
(b) true
(c) false
I had been asked this question in class test.
My query is from From PDA to Grammars in section Push Down Automata of Automata Theory