How do I implement the SLR$\_$parse$\_$table in the following section of code?

$//$ Generate the SLR Parsing Table $($Action and Goto tables$)$

void SLR$\_$parse$\_$tables$($const vector& grammar$)\{$

$$ cout

SLR Parsing Table $($Action and Goto$)$:

$"$;

$//$ Pseudo$-$code for table construction

$//$ For each state in canonicalCollection:

$//$ For each item in the state:

$//$ if item is $[$A $->$ $.$ a $]$ where $\text{'}$a$\text{'}$ is terminal:

$//$ actionTable$[$state$][$a$]="$s$"+$ nextState

$//$ if item is $[$A $->$ $.]$:

$//$ for each symbol in Follow$($A$)$:

$//$ actionTable$[$state$][$symbol$]="$r$"+$ rule number

$//$ if item is $[$S$\text{'}->$ S $.]$:

$//$ actionTable$[$state$]["$$$"]=$ "acc"

$//$ For each non$-$terminal A:

$//$ if Goto$($state$,$ A$)$ is non$-$empty:

$//$ gotoTable$[$state$][$A$]=$ nextState

$\}$

Follow$-$up for In C$++$Programming$,$I am attempting to implement the following grammar:

Basic Grammar

$(1)$E$->$E$+$T$$

$(2)$E$\text{'}->$T$$

$(3)$T$->$T$*$F$$

$(4)$T$->$F$$

$(5)$F$->($E$)$

$(6)$F$->$id

Into the following algorithms:

Please implement the following algorithms

$($i$)$Closure$($I$)$

$($ii$)$Follow$($S$)$

$($iii$)$Goto$($State$,$X$)$

$($iv$)$CanonicalSet$($I$)$

$($v$)$SLR$\_$parse$\_$tables$($grammar$)$

Please test your algorithm$($v$)$using the basic grammar and output the following Action$\_$and$\_$Goto Table.

$\backslash$begin$\{$tabular$\}\{|$c$|$c$|$c$|$c$|$c$|$c$|$c$|$c$|$c$|$c$|\}$

$\backslash$hline $\backslash$multirow$[$t$]\{2\}\{*\}\{$State$\}$ & $\backslash$multicolumn$\{6\}\{|$c$|\}\{$action$\}$ & $\backslash$multicolumn$\{3\}\{|$c$|\}\{$goto$\}\backslash \backslash$

$\backslash$hline & id & $\backslash (+\backslash )$ & $*$ & $($ & $)$ & $\backslash$$ & E & T & F $\backslash \backslash$

$\backslash$hline $0$ & s$5$ & & & s$4$ & & & $1$ & $2$ & $3\backslash \backslash$

$\backslash$hline $1$ & & s$6$ & & & & acc & & & $\backslash \backslash$

$\backslash$hline $2$ & & r$2$ & s$7$ & & r$2$ & r$2$ & & & $\backslash \backslash$

$\backslash$hline $3$ & & r$4$ & r$4$ & & r$4$ & r$4$ & & & $\backslash \backslash$

$\backslash$hline $4$ & s$5$ & & & s$4$ & & & $8$ & $2$ & $3\backslash \backslash$

$\backslash$hline $5$ & & r$6$ & r$6$ & & r$6$ & r$6$ & & & $\backslash \backslash$

$\backslash$hline $6$ & s$5$ & & & s$4$ & & & & $9$ & $3\backslash \backslash$

$\backslash$hline $7$ & s$5$ & & & s$4$ & & & & & $10\backslash \backslash$

$\backslash$hline $8$ & & s$6$ & & & s$11$ & & & & $\backslash \backslash$

$\backslash$hline $9$ & & r$1$ & s$7$ & & r$1$ & r$1$ & & & $\backslash \backslash$

$\backslash$hline $10$ & & r$3$ & r$3$ & & r$3$ & r$3$ & & & $\backslash \backslash$

$\backslash$hline $11$ & & r$5$ & r$5$ & & r$5$ & r$5$ & & & $\backslash \backslash$

$\backslash$hline

$\backslash$end$\{$tabular$\}$