Description: However, grammars that are not left recursive and are left factored may still not be LL(1).
To see if a grammar is LL(1), try to build the parse table for the predictive parser by the
method we are about to describe. If any element in the table contains more than one
grammar rule right-hand side, then the grammar is not LL(1).
To build the table, we must must compute FIRST and FOLLOW sets for the grammar.
To Search:
File list (Check if you may need any files):
FirstFollowLL.pdf