UGC NET CS 2017 Jan -paper-2
March 12, 2024UGC NET CS 2012 June-Paper2
March 12, 2024Theory-of-Computation
|
Question 10
|
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, then how long is a derivation of w in G?
|
Theory Explanation.
|
Correct Answer: A