News for hackers. Stuff that matters.
Re:I hate the Pumping Lemma by kingkilr on Sunday August 18, 2013 @10:32PM (#6235288)
I'm not sure if they're turing complete, however many many many common regexp dialects (as seen in perl, ruby, python, etc.) are more powerful than what you learned as "regular expressions" in CS class, they're at least as powerful as a PDA.
Re:I hate the Pumping Lemma by chimeracoder on Sunday August 18, 2013 @10:36PM (#6235300)
> they're at least as powerful as a PDA.

PCREs (ie, the regular expressions that Perl uses) are NP-hard, since they allow backreferences.

Re:I hate the Pumping Lemma by kazagistar on Monday August 19, 2013 @01:22AM (#6235775)
I think you are confusing complexity and computability class.
Re:I hate the Pumping Lemma by anaphor on Monday August 19, 2013 @06:54AM (#6236496)
Do you mean that some regex implementations allow you to parse context-free grammars?
Re:I hate the Pumping Lemma by hyperpape on Monday August 19, 2013 @11:39AM (#6237803)
Most regex implementations allow you to parse some context-free grammars, and even some non-context-free grammars. But they don't let you parse all context-free grammars.

reference: http://cstheory.stackexchange.com/questions/1047/where-do-mo...

Re:I hate the Pumping Lemma by anaphor on Monday August 19, 2013 @04:59PM (#6239789)
Yeah, I should've said "all". I know that you can describe regular grammars using languages designed for CFGs, like BNF.