Check if grammar is LL(1) ?

Question

Given a grammar :

$E \rightarrow E + T / T$

$T \rightarrow i$

Can I directly say that grammar is not $LL(1)$  because $LL(1)$ can't parse Left Recursive Grammar, without drawing parsing table ?

Answer 1

you are right

if a grammar is Left Recursive ,left factoring and ambiguous. then it never be LL(1)

given grammar is left Recursive. then we can directly say it is not LL(1).

Comments

if a grammer is Left Recursive , Non-determinstic(multiple production on RHS part ), and ambigious then it will never be LL(1).

To solve non-determinism  left factoring of  CFG is done.