| From: | David Fetter <david(at)fetter(dot)org> |
|---|---|
| To: | SF Postgres <sfpug(at)postgresql(dot)org> |
| Subject: | Perl Regular Expressions |
| Date: | 2007-01-12 23:43:35 |
| Message-ID: | 20070112234335.GF8263@fetter.org |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | sfpug |
Folks,
We were discussing Perl's, um, amazing regular expressions this past
meeting, and I think that this shows that they are Turing-equivalent.
http://www.netwise.it/xml/perlmonks/?node_id=297616
Cheers,
D
--
David Fetter <david(at)fetter(dot)org> http://fetter.org/
phone: +1 415 235 3778 AIM: dfetter666
Skype: davidfetter
Some people, when confronted with a problem, think, "I know. I'll use
regular expressions." Now they have two problems.
Jamie Zawinski
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Meredith L. Patterson | 2007-01-13 06:50:23 | Re: Questions for Meredith |
| Previous Message | Josh Berkus | 2007-01-11 20:37:15 | Questions for Meredith |