Given Checklistbr I G Has No Useless Symbolsbr Ii G Has No Unit #432

Given Checklist:<br /> i) G has no useless symbols<br /> ii) G has no unit productions<br /> iii) G has no epsilon productions<br /> iv) Normal form for production is violated<br /> Is it possible for the grammar G to be in CNF with the following checklist?

This multiple choice question (MCQ) is related to the book/course gs gs101 Automata Theory. It can also be found in gs gs101 Context Free Grammars and Languages - Inferences to Trees and Trees to Derivations - Quiz No.1.