Chomsky normal form (CNF) is a normal form for context-free grammars. Select all of the following statements that are true.

Consider the following context-free grammar:

Chomsky normal form (CNF) is a normal form for context-free grammars. Select all of the following statements that are true. For every regular language there exists a context-free grammar in CNF that generates the language. Every context-free grammar is in CNF A rule of the form R + aB is a valid rule in CNF. Every grammar expressed in CNF is unambiguous. For every context-free grammar G there exists a grammar H in CNF such that L(G) = L(H) Consider the following context-free grammar G = (V, E, R, S), where the production rules are S0S0 151 Select all of the following statements that are true. = {0, 1} The grammar generates the empty language. IEEL(G) The grammar is in Chomsky normal form. L(G) is regular G is unambiguous