GATE 2012 What is the maximum number of reduce moves

0

GATE 2012 
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) 2n

Ravi Garg edited question
    Add image to editor add image from link

    Question stats

    • Active
    • Views93 times
    • Answers0 answers
    • Followers1 follower
    Question and answer is powered by AnsPress