LL(1) Table Generation
For every production A in the grammar:
1. If can derive a string starting with
a (i.e., for all a in FIRST( ) ,
Table [A, a] = A
2. If
can derive the empty string, , then, for all b that can follow
a string derived from A (i.e., for all b in FOLLOW (A) ,
Table [A,b] = A
EXAMPLE 5 Constructing an LL(1) parse table entry using rule 1
Send questions and comments to: Karen Lemone