Given the following grammar for a Prolog term list

TL $->$ T

$|$ TL $,$ T

where T $($term$)$ is another non$-$terminals and the comma is a terminal symbol. Term is not nullable. Indicate what $($if anything$)$ would prevent a recursive$-$descent parser from parsing a Prolog term list according to this grammr: