How to solve ? Clarity about unit productions
Screenshot from 2015-01-31 17:20:29.png
Ans is (B). To have maximum number of reduce moves, all the productions will be of the type A → αβ (where α and β could be terminals or non-terminals).
Ans will be B
now suppose string is aabb
->aabb (reduction 1)
n = 4
and number of reductions are 3 so n-1