Teaching TN TRB CS Mock Test Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
A CFG (Context Free Grammar) is said to be in Chomsky Normal Form (CNF), if all the productions are of the form A → BC or A → a. Let G be a CFG in CNF. To derive a string of terminals of length x, the number of products to be used is
1
2x - 1
2
2x
3
2x + 1
4
2