Syntax Analysis33
0. The grammar S → aSa |bS|c is
- Option : C
- Explanation : t is LL(1) and LR(1)
because in S → aSa
S → bS
S → c
no mult iple ent r ies for 1 iteration, so it is LL(1)
grammer mean by LR(1) that it is Left shift
Reduced grammer and so it is also LR(1).
Hence it is both LL(1) and LR(1)
