Discussion :: GATE CSE
- 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?
Whatsapp
Facebook
Answer : Option B
Explanation :
-NA-
Be The First To Comment