Q. 82 Which of the following statements are true ?
1. Every left-recursive grammar can be converted to a right-recursive grammar and vice-versa 2. All e-productions can be removed from any context-free grammar by suitable transformations 3. The language generated by a context-free grammar all of whose production are of the form X " w or X " wY (where, w is a staring of terminals and Y is a non-terminal), is always regular 4. The derivation trees of strings generated by a context-free grammar in Chomsky Normal Form are always binary trees.
(A)I, II, III and IV
(B)II, III and IV only
(C)I, III and IV only
(D)I, II and IV only
Answer: (C)
Explanation:
