Grammar of a non-regular language
You should think of this language as all words of the form
$$
xa^nya^n,
$$
where $x=ab$ and $y \in b^*$. You can now modify a grammar for $a^nb^n$ to generate your language.