Provide an example of a context$-$free grammar $($CFG$)$ over the alphabet

$\{$a$,$b$,$c$,$d$,$e$\}$ that satisfies all the following criteria:

The grammar must be SLR$(1).$

There must be a specific word for which the SLR$(1)$ parser will perform reductions before discovering an error, whereas an LALR$(1)$ parser will immediately detect the error.

There must be another specific word for which the LALR$(1)$ parser will perform reductions before discovering the error, whereas a canonical LR$(1)$ parser will immediately detect the error.

In your response, please include the following elements:

A$.$ Introduce the Grammar:

Present the grammar that meets the above requirements.

B$.$ Construct the LR$(0)$ Item Automaton of the Extended Grammar:

Detail the steps and the resulting automaton for the extended version of your grammar.