To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:
(A) 2n – 1
(B) 2n
(C) n + 1
(D) n ²


Answer: (A)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post