LR(1) parser is used to construct the DFA , solve this compiler question


#1

given look ahead is right on first T production ?

Let G be a grammar with the following productions:
image

If LR(1) parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an item T → .T * F in the initial state ________.

given ans:
image


#2

consider the follow of each Variables {E, T, F}