I am learning Compiler Design. Can somebody explain what type of Grammar this is? The answer given is $LL(1)$ but there exists a left recursion in the grammar so it cannot be $LL(1)$. I derived the parse table it had conflicts. Am I doing some thing wrong or is the answer given wrong?
My texbook defines:
For LL(1) Grammar if there is left recursion or left factoring then that grammar is not LL(1) grammar if this applies to this grammar then it is not a LL(1) grammar
$E \to E+T \mid E$
$T \to T$#$F \mid F$
$F \to (E) \mid i$
I also have one more question: "Is there a Grammar which can be LL(1) but not LALR(1)"