Same as the last problem in Project $2,$ include the S $->$ F$=$E rule to the beginning of the grammar so that the grammar is as below:

S $->$ F $=$ E

E $->$ E & T

E $->$ E $\%$ T

E $->$ F $!$

F $->$ F $<$ T

F $->$ F $>$ T

F $->$ t $|$ f

T $->($E$)|$ t $|$ f

Compute FIRST and FOLLOW sets for S$,$ E$,$ F$,$ T in the new grammar.