Discussion Forum
Que.  What is the maximum number of reduce moves that can be taken by a bottomup parser for a grammar with no epsilon and unitproduction (i.e., of type A > є and A > a) to parse a string with n tokens? 
a.  n/2 
b.  n1 
c.  2n1 
d.  2^n 
Answer:n1
