$$ Give an example of a context$-$free grammar over the alphabet $\{$e$,$d$,$c$,$b$,$a$\{,$ which satisfies all

The following features:

$$ The grammar is $(1)$SLR$.$

$$ There is a word, on which the $(1)$ SLR will perform reductions, before it discovers the

the error, while the $(1)$ LALR breaker will immediately detect the error.

$$ There is a word, on which paragraph $(1)$ LALR will make reductions, before he discovers the

the error, while a canonical $(1)$LR breaker will immediately detect the error