...
Question 6356 – Algorithms
November 26, 2023
Question 8075 – Data-Structures
November 26, 2023
Question 6356 – Algorithms
November 26, 2023
Question 8075 – Data-Structures
November 26, 2023

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:
A
(K – 1) |P| + |T| – 1
B
(K – 1) |P| +| T|
C
K |P| + |T| – 1
D
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|
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x