A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. The grammar S → aSa | bS | c is
a. LL(1) but not LR(1)
b. LR(1)but not LR(1)
c. Both LL(1)and LR(1)
d. Neither LL(1)nor LR(1)
Answer:Both LL(1)and LR(1)
Bittu :(November 26, 2019) But the grammer is Ambigious then how it can be Both LL (1) and LR (1).
Please Explain if this Grammer is Not Ambigious.
Click to Add Comment

Bittu :(November 26, 2019) S S
/ | \ / / | \ / a S a a S
/ \ |
/ \ c
b S
Click to Add Comment

Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: