UGC NET Computer Science July 2018 - II Question 35

Question 35

---

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

Options:

1. (1) 2n−1
2. (2) 2n
3. (3) n+1
4. (4) n²

Answer : (1) 2n−1

Explanation Question 35

In CNF , the height of the syntax tree is 2n-1 i.e. 2n-1 productions are used to obtain a string on n terminals.

Previous	Next
UGC NET CS 2018 July - II Question 34	UGC NET CS 2018 July - II Question 36