Computer Sciences > Gate 2020 > Bottom-up Parser
Consider the following grammar.
S → aSB ∣ d
B → b
The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is ________ .
B → b
The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is ________ .
Correct : 7
Similar Questions
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64
Choose the word that is opposite in meaning to the word “coherent”.
Total Unique Visitors
Loading......