✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Given the grammar:
S -> aA | bB
A -> a | aA
B -> b | bB
Which of the following input strings can be parsed using LL(1) parsing?
A) aaaB) abababC) aababbD) bbaaa