Consider the following grammar G: S → A | B A → a | c B → b | c Where {S, A,…
Consider the following grammar G:
S → A | B
A → a | c
B → b | c
Where {S, A, B} is the set of non-terminals and {a, b, c} is the set of terminals.
Which of the following statement(s) is/are correct?
S₁: LR(1) can parse all strings that are generated using grammar G.
S₂: LL(1) can parse all strings that are generated using grammar G.
Choose the correct answer:
- A.
Only S₁
- B.
Only S₂
- C.
Both S₁ and S₂
- D.
Neither S₁ nor S₂
Attempted by 37 students.
Sign up free to check your answer
Sign up freeLoading lesson…

