SLR parse for the grammar $E\to E+T\mid T$, $T\to T*F\mid F$, $F\to \mathbf{id}$

(The paper spells the token td; we treat it as the identifier token id.)

Augment with $E'\to E$.

Productions numbering:

1. $E\to E+T$
2. $E\to T$
3. $T\to T*F$
4. $T\to F$
5. $F\to\mathbf{id}$

LR(0) canonical collection (states $I_0$–$I_8$):

• $I_0$: $E'\to\cdot E,\ E\to\cdot E+T,\ E\to\cdot T,\ T\to\cdot T*F,\ T\to\cdot F,\ F\to\cdot\mathbf{id}$
• $I_1 = goto(I_0,E)$: $E'\to E\cdot$, $E\to E\cdot+T$
• $I_2 = goto(I_0,T)$: $E\to T\cdot$, $T\to T\cdot*F$
• $I_3 = goto(I_0,F)$: $T\to F\cdot$
• $I_4 = goto(I_0,id)$: $F\to \mathbf{id}\cdot$
• $I_5 = goto(I_1,+)$: $E\to E+\cdot T$, $T\to\cdot T*F$, $T\to\cdot F$, $F\to\cdot\mathbf{id}$
• $I_6 = goto(I_2,*)$: $T\to T*\cdot F$, $F\to\cdot\mathbf{id}$
• $I_7 = goto(I_5,T)$: $E\to E+T\cdot$, $T\to T\cdot*F$
• $I_8 = goto(I_6,F)$: $T\to T*F\cdot$

GOTO transitions: $0\xrightarrow{E}1,\ 0\xrightarrow{T}2,\ 0\xrightarrow{F}3,\ 0\xrightarrow{id}4$;
$1\xrightarrow{+}5$; $2\xrightarrow{*}6$; $5\xrightarrow{T}7,\ 5\xrightarrow{F}3,\ 5\xrightarrow{id}4$; $6\xrightarrow{F}8,\ 6\xrightarrow{id}4$; $7\xrightarrow{*}6$.

(This is the state-transition diagram; every state is a node and every label above is an edge.)

FOLLOW sets:

• $\mathrm{FOLLOW}(E)={+, $}$(start) ∪ `+` from$E\to E+T$.
• $\mathrm{FOLLOW}(T)={+,,$}$ (E→E+T ⇒ FOLLOW(E), T→TF ⇒ *).
• $\mathrm{FOLLOW}(F)={+,*,$}$.

SLR parsing table (ACTION + GOTO):

State	id	+	*	$	E	T	F
0	s4				1	2	3
1		s5		acc
2		r2	s6	r2
3		r4	r4	r4
4		r5	r5	r5
5	s4					7	3
6	s4						8
7		r1	s6	r1
8		r3	r3	r3

• s n = shift and go to state n; r k = reduce by production $k$ (list above); acc = accept.
• Uses FOLLOW: r4/r5 in states 3/4 for +, *, $ (in FOLLOW(T)/FOLLOW(F)) etc.

No cell has two actions → the grammar is SLR(1) (a conflict-free table), and id + id * id is accepted.