Consider the following grammar:
$S \to a S B | d$
$B \to b$

The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is
7

Open in App

Solution

The correct option is A 7
$S \to a S B$
$\to a a S B B [S \to a S B]$
$\to a a a S B B B [S \to a S B]$
$\to a a a d B B B [S \to d]$
$\to a a a d b B B [B \to b]$
$\to a a a d b b B [B \to b]$
$\to a a a d b b b [B \to b]$

Total 7 steps required.

Suggest Corrections

Similar questions

\to

\to

S \to F R

R \to^{*} S | ε

F \to i d

S \to A B A \to (S) | a S b | d B \to a B | ε

I f X = F i r s t (S), Y = F i r s t (A) a n d Z = F i r s t (B) t h e n (X \cap Y) - Z

S \to a S b | b S a | a S | b S | a

S \to S A B C

A \to a A d | ϵ

B \to b B | ϵ

C \to C c | B e | ϵ

Join BYJU'S Learning Program