2712
You visited us
2712
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Standard X
Mathematics
Determinant
Consider the ...
Question
Consider the following grammar:
S
→
a
S
B
|
d
B
→
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
→
a
S
B
→
a
a
S
B
B
[
S
→
a
S
B
]
→
a
a
a
S
B
B
B
[
S
→
a
S
B
]
→
a
a
a
d
B
B
B
[
S
→
d
]
→
a
a
a
d
b
B
B
[
B
→
b
]
→
a
a
a
d
b
b
B
[
B
→
b
]
→
a
a
a
d
b
b
b
[
B
→
b
]
Total 7 steps required.
Suggest Corrections
0
Similar questions
Q.
Consider the following grammer:
S
→
aSB|d
B
→
b
The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is _____.
Q.
Consider the following grammar:
S
→
F
R
R
→
∗
S
|
ε
F
→
i
d
In the predictive parser table, M, of the grammar the entries M[S, id] and M[R, $] respectively
Q.
Consider the following grammar.
S
→
A
B
A
→
(
S
)
|
a
S
b
|
d
B
→
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
∩
Y
)
−
Z
is_________.
Q.
Consider the following CFG.
S
→
a
S
b
|
b
S
a
|
a
S
|
b
S
|
a
Which of the following string cannot be generated by given CFG?
Q.
Consider the following grammar:
S
→
S
A
B
C
A
→
a
A
d
|
ϵ
B
→
b
B
|
ϵ
C
→
C
c
|
B
e
|
ϵ
Variables S, A, B, C are non-terminals and a, b, c, d, e are terminals.
What is the number of elements in FOLLOW(S)?
View More
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
Related Videos
Determinant.
MATHEMATICS
Watch in App
Explore more
Determinant
Standard X Mathematics
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
AI Tutor
Textbooks
Question Papers
Install app