UGC-NET DEC-2019 Part-2
|
Question 2
|
Let G = (V, T, S, P) be any context-free grammar without any λ-productions or unit productions. Let K be the maximum number of symbols on the right of any production P. The maximum number of production rules for any equivalent grammar in Chomsky normal form is given by:
|
(K – 1) |P| + |T| – 1
|
|
|
(K – 1) |P| +| T|
|
|
|
K |P| + |T| – 1
|
|
|
K |P| + |T|
|
Question 2 Explanation:
Let G = (V, T, S, P) be any context-free grammar without any λ-productions or unit productions. Let K be the maximum number of symbols on the right of any production P. The maximum number of production rules for any equivalent grammar in Chomsky normal form is given by (K – 1) |P| + |T|
Correct Answer: B
Question 2 Explanation:
Let G = (V, T, S, P) be any context-free grammar without any λ-productions or unit productions. Let K be the maximum number of symbols on the right of any production P. The maximum number of production rules for any equivalent grammar in Chomsky normal form is given by (K – 1) |P| + |T|