Question

Which of the following statements is TRUE regarding LL(1) grammars?

• A. A grammar with left recursion can be LL(1).
• B. Every LL(1) grammar is also LR(1).
• C. LL(1) parsers are bottom-up parsers.
• D. Ambiguous grammars can be LL(1).

Hint:

To convert a grammar into an LL(1) format, you must perform "Left Recursion Elimination" and "Left Factoring" to ensure the parser can always make a unique choice based on the next input symbol.

Answer 1

The Correct Option is B