Consider the following grammar:

$S$aSa$|B||$

$BbB|b||$

i$)$ Build SLR$(1)$ parse tables for this grammar. If such is not possible, clearly show the resulting conflicts.

ii$)$ If you could build parse tables, show how the input aabbaa would be successfully parsed by your tables.

$5.$ Consider the following grammar:

$S$aSa$|lon||$

i$)$ Build SLR$(1)$ parse tables for this grammar. If such is not possible, clearly show the resulting conflicts.

ii$)$ If you could build parse tables, show how the input aaaa would be successfully parsed by your tables.