Nielit Scientist-B CS 22-07-2017 | Parsers

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?

  1. N/2
  2. N-1
  3. 2n-1
  4. 2n

Answer : B,

Do U have Better Solution ?
Contribute your Solution in Comment Section below

Leave a Reply