GATE Computer Science (CS) 2013 Solved Paper

Question : 19 of 65

Marks: +1, -0

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?