NLP 25

0. Which of the following are true?
1. Given a CFG and its corresponding CNF, they both produce the same language.
2. For a given grammar, there can be more than one CNF
3. It requires '2n+1' productions or steps in CNF to generate a string w of length 'n'
4. None of the above

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *