UGC NET JULY 2018 (Computer Science And Applications Paper-II) (Question 35-36)
Q 35. To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is :
(1) 2n−1
(2) 2n
(3) n+1
(4) n2
Answer: (1) 2n−1
Q 36. Consider the following two Grammars :
Which of the following option is correct ?
(1) Only G1 is ambiguous
(2) Only G2 is ambiguous
(3) Both G1 and G2 are ambiguous
(4) Both G1 and G2 are not ambiguous
Answer: (3) Both G1 and G2 are ambiguous
0 comments:
Post a Comment