GATE Papers >> CSE >> 2013 >> Question No 9

Question No. 9 CSE | GATE 2013

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 Aa) to parse a string with n tokens?


Answer : (B) n-1


Comments
No Comments
Leave a comment