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
Total Unique Visitors
Loading......