What is the maximum number of reduce moves that can be taken by a bottom-up…

PYQ GATE 2013

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 nn tokens?

  1. A.

    n/2n/2

  2. B.

    n−1n-1

  3. C.

    2n−12n-1

  4. D.

    2n2^n

Attempted by 158 students.

Sign up free to check your answer

Sign up free

Explore the full course: Compiler Design

Loading lesson…