Consider the following grammar (describing assignment statements). v is variable, n is number (you may assume variables have already been found in symbol table).

S -> v = E

E-> E+T | T

T-> T*F | F

F-> n | v

F-> (E)

Find FIRST, FOLLOW and LR(0) sets for this grammar. Is the grammar LR(0)? Is it SLR?