How many Minimum number of Backtracks Required :-
Soln.
According to me it Max = 3 and Min = 0, because left factoring is there, and say compiler was lucky and chooses the production which finally leads to desired string in one go i.e. S -> aAb -> aab. So 0 backtracks there isn't it ?
Please Verify if something is wrong?