What is the maximum number of reduce moves that can be taken by a bottom-up…
GATE · 2013 · CS · Computer Science & IT
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?
- A.
\(n/2\) - B.
\(n-1\) - C.
\(2n-1\) - D.
\(2^n\)
Attempted by 80 students.
Show answer
Correct answer: B
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…