For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that need to be filled are indicated as E1, E2, and E3. ε is the empty string, $ indicates end of input, and I separates alternate right hand sides of productions. S

The First and Follow sets for the non-terminals A and B are
(A) FIRST( A) = {a, b, E} = FIRST (B)
FOLLOW(A) = {a, b}
FOLLOW(B) = {a, b, $}
(B) FIRST(A) = {a, b, $}
FIRST(B) = {a, b, E}
FOLLOW(A) = {a, b}
FOLLOW(B) ={$}
(C) FIRST(A) = {a, b, E} = FIRST(B)
FIRST(A) = {a, b}
FOLLOW(B) = Φ
(D) FIRST(A) ={a, b,} = FIRST(B)
FIRST(A) = {a, b}
FOLLOW(B) ={a, b}