To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is :

1. A2n − 1
2. B2n
3. Cn + 1
4. Dn²

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: A. 2n − 1

Explanation

In CNF, n − 1 productions of the form A → BC create n variables and n productions A → a turn them into terminals: 2n − 1 steps.