Re:A Perl Regular Expression That Matches Prime Numbers
by theshadow on Sunday December 25, 2011 @09:38PM
(#3392079)
Perl regular expressions probably accept more than just context-free grammars since the language that accepts prime numbers is not Context-Free, you can't build a pushdown automaton for such a language, there is a relatively trivial proof of this using the pumping lemma for context-free languages.
[ Parent
| on HN ]
There are no comments on this comment yet.