Finding a context free grammar (CFG) for a non-context free language (CFL) a^n b^n c^n

It is known that the language $$\{a^nb^nc^n|n\geq0\}$$ is not context-free (we can prove it using the pumping lemma, as shown here: Is $a^n b^n c^n$ context-free?). Yet, this answer claims it has found a context-free grammar for this language. My question is, is it possible to find a context free grammar for a not context-free language?

• The CFG is not given for $L = \{a^nb^nc^n\mid n\geqslant 0\}$ in the post you quote, but for $a^*b^*c^*\setminus L$ which is context-free. Apr 7 at 23:05