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 _______.

Correct Answer:

7

Solution:

Reductions = 7