Given the following grammar for a Prolog clause:

C $->$ T $.$

$|$ T :$-$ TL $.$

$|$ :$-$ TL $.$

where T $($term$)$ and TL $($term list$)$ are other non$-$terminals and :$-$ and the dot are terminal symbols. Neither non$-$terminal is nullable. Indicate what $($if anything$)$ would prevent a recursive$-$descent parser from parsing a Prolog clause according to this grammar.

Question $29$ Select one:

The grammar has a common left factor.

The grammar is left$-$recursive.

There is no problem with this grammar.

The grammar is ambiguous for input :$-$ TL $.$