Hacker News Reader

Via the context-free pumping lemma, you can even prove that prime numbers don't form a context-free language either.

And via Parikh's theorem, with a one-symbol alphabet, regular and context-free languages are the same.