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

Question No. 9

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 $\mathrm{A}\to \mathrm{ϵ}$ and $\mathrm{A}\to \mathrm{a}$) to parse a string with n tokens?