Q50

Every left-recursive grammar can be converted to a right-recursive grammar and vice-versa

All $\epsilon$-productions can be removed from any context-free grammar by suitable transformations

The language generated by a context-free grammar all of whose productions are of the form $X \rightarrow w$ or $X \rightarrow wY$ (where, $w$ is a string of terminals and $Y$ is a non-terminal), is always regular

The derivation trees of strings generated by a context-free grammar in Chomsky Normal Form are always binary trees