S → bA | aB
A → AaS | BcA | a
B → bS | ε
FIRST (S) = FIRST(bA) U FIRST (aB)
= {b,a}
FIRST (A) = FIRST(AaS) U FIRST(BcA) U FIRST(a) ------------ {FIRST(AaS) We will not consider this beacuse of recurssion}
= FIRST(B)-{ε} U {a}
={b,ε}-{ε} U {a}
FIRST (A) = {b, a}
FOLLOW(A) = {a} U FOLLOW (A) U FOLLOW(S)
={ a, $}
FOLLOW(B) = {c} U FOLLOW(S)
S → aB
FOLLOW(B) ={$,c}
FOLLOW (S) = {$} U FOLLOW(S) U FOLLOW(S)
A → AaS B → bS
={$} U FOLLOW(A) U FOLLOW(B)
={$} U { a, $} U {$,c}
FOLLOW (S) = { $, a, c}