Exercise 4.

Consider the following grammar G with terminals a, b, e, i, t and nonterminals S, S', E.

S	$\longmapsto$	i E t S S'  |  a
S'	$\longmapsto$	e S  |  $\varepsilon$
E	$\longmapsto$	b

We recall the rules for the computation of the FOLLOW set of each nonterminal.

if	A $$\longmapsto$$ $$\alpha$$B$$\beta$$	then	$$\mbox{{\sc FOLLOW}($B$)}$$ : = $$\mbox{{\sc FIRST}(${\beta}$)}$$ $$\setminus$$ {$$\varepsilon$$}  $$\cup$$  $$\mbox{{\sc FOLLOW}($B$)}$$
if	A $$\longmapsto$$ $$\alpha$$B	then	$$\mbox{{\sc FOLLOW}($B$)}$$ : = $$\mbox{{\sc FOLLOW}($B$)}$$  $$\cup$$  $$\mbox{{\sc FOLLOW}($A$)}$$
if	$$\left\{\vphantom{ \begin{array}{l} A \longmapsto {\alpha} B {\beta} \\ {\beta} \stackrel{\ast}{\Longrightarrow} {\varepsilon} \end{array} }\right.$$$$\begin{array}{l} A \longmapsto {\alpha} B {\beta} \\ {\beta} \stackrel{\ast}{\Longrightarrow} {\varepsilon} \end{array}$$	then	$$\mbox{{\sc FOLLOW}($B$)}$$ : = $$\mbox{{\sc FOLLOW}($B$)}$$  $$\cup$$  $$\mbox{{\sc FOLLOW}($A$)}$$

Give the parsing table (for the non-recursive implementation of predictive parsing)

Answer 4