Consider the following grammar G: S → AaBb ∣ bAB ∣ ε A → dB ∣ Sb ∣ ε B → a ∣ ε…
Consider the following grammar G:
S → AaBb ∣ bAB ∣ ε
A → dB ∣ Sb ∣ ε
B → a ∣ ε
Which of the following statements is/are correct?
- A.
Grammar G is LL(1).
- B.
Grammar G is LL(1), and the number of entries filled in its LL(1) parsing table is 11.
- C.
Grammar G is not LL(1) because the grammar is ambiguous.
- D.
Grammar G is not LL(1) because of multiple entries in some parsing table cells.
Attempted by 19 students.
Sign up free to check your answer
Sign up freeLoading lesson…

