lets consider a grammar as:
$A\rightarrow Ab | Ac | a$
while checking whether it belongs to LL(1) grammar, we would point out that it has a left recursion as well as left factoring.
I was wondering that what would be the case if we had lookahead, k, greater than 1.
So if look ahead , k =2.
will there be any need to remove left recursion or left factoring. Furthermore, should we still call it as a:
1) left recursion: because if we are looking 2 symbols at a time, there shouldnt be any recursion at all.
2) left factoring: we need not backtrack as we are looking beyond the common symbol, A to decide the production rule to be applied.
any further insights about the same will be very helpful.