Which of the following statements is/are true?

Let us analyze the given statements about $\text{LL}(1)$ parsers:

• (A) False: An $\text{LL}(1)$ parser is a predictive, deterministic top-down parser that makes parsing decisions using a single lookahead token without backtracking.

• (B) False: If a grammar contains left recursion, the $\text{LL}(1)$ parser will enter an infinite loop or encounter multiple entries in the parsing table. Hence, an $\text{LL}(1)$ grammar must not be left-recursive.

• (C) True: Left-factoring is necessary to remove common prefixes from the right-hand sides of production rules so that the parser can deterministically choose the correct rule using a single lookahead token. Thus, a grammar must be left-factored to be $\text{LL}(1)$.

• (D) False: $\text{SLR}(1)$ is a bottom-up parsing method that is strictly more powerful than top-down $\text{LL}(1)$ parsing (i.e., every $\text{LL}(1)$ grammar is $\text{LR}(1)$, and $\text{SLR}(1)$ can handle a broader class of grammars than $\text{LL}(1)$).

Hence, only statement (C) is correct.