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 tokens?
- A.
- B.
- C.
- D.
Attempted by 158 students.
Sign up free to check your answer
Sign up freeLoading lesson…

