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)

Name: 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)
Brand: Quizplus
Rating: 4.9 (31 reviews)

Question

Quizplus · Accepted Answer

The grammar is both LL(1) and LR(1) because it does not have left recursion or ambiguity, and it is possible to construct parsing tables for both LL(1) and LR(1) parsing methods without conflicts.

The Grammar S ? ASa | BS | C Is