Question
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?
Answer: Option B
Was this answer helpful ?
-NA-
Was this answer helpful ?
Submit Solution