A grammar G is in Chomsky-Normal Form (CNF) if all its productions are of the…
PYQ GATE 1994Modified — slightly modified from the official paper; see the solution
A grammar G is in Chomsky-Normal Form (CNF) if all its productions are of the form A → BC or A → a, where A, B and C, are non-terminals and a is a terminal. Suppose G is a CFG in CNF and w is a string in L(G) of length n, then how long is a derivation of w in G?
Sign up free to check your answer
Sign up freeLoading lesson…

