Context free grammar for {a^mb^n | m ≠ n} I need to find a context-free grammar for the above expression, $a^{m}b^{n}$ for the set $L = \left\{{a, b}\right\}$, but I am having difficulty accounting for the condition $m \neq n$.

This is what I have so far, but it clearly doesn't satisfy the above condition:

$\begin{align}
   &amp;S \rightarrow aAb &amp;\\
   &amp;S \rightarrow a &amp;\\
   &amp;S \rightarrow b &amp;\\
   &amp;A \rightarrow aA &amp;\\
   &amp;A \rightarrow bA &amp;\\
   &amp;A \rightarrow \lambda \\
\end{align}$

I have spent about an hour on this, and haven't found a solution. Any ideas?
Hint: Start with a CFG for the language $\{ a^{n+t} b^n : n \geq 0, t \geq 1 \}$.