A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A -> є and A -> a) to parse a string with n tokens?
a. n/2
b. n-1
c. 2n-1
d. 2^n
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: