You're replying to a comment by epiphany47.

epiphany47 Permalink
December 26, 2011, 08:47

This isn't a "regular expression", it's a "regexp" =] - see comments on HN:

This script uses backreferences which give regexp's more "computing power" than regular expressions actually have, but remove the guaranteed runtime of an O(n) regular expression. For more, read the excellent article at

You can actually prove that "regular expressions" don't have the computing power to enumerate the prime numbers. For more, read the wiki article,

On an unrelated note, I've been a longtime fan of your NodeJS articles, and look forward to more of your writing. =]

Reply To This Comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Type the word "lcd_298": (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.