Not respecting the 3rd rule of a LL(1) grammar I'm trying to build a grammar that violate only the 3rd rule. I'm trying to figure out what kind of grammar would not respect that.

I think the grammar has to be left-recursive to not respect it.

if $\beta \Rightarrow^* \epsilon$ then $\alpha$ does not derive any string beginning with a terminal in $\mathop {FOLLOW}(A)$. Where $A \to \alpha \mid \beta$

Am I right to think that?
Something like the following:

$\begin{align}
  S &amp;\to A a \\
  A &amp;\to a \mid \epsilon
\end{align}$