[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Stupid module and pregexp questions
From: |
tomas |
Subject: |
Re: Stupid module and pregexp questions |
Date: |
Mon, 27 Oct 2003 11:26:02 +0100 |
User-agent: |
Mutt/1.5.3i |
On Fri, Oct 24, 2003 at 03:58:18PM -0700, Tom Lord wrote:
>
[snip]
> The so-far (mostly) unasked question is whether we can achieve similar
> (practical, not theoretic) expressivity to those tweaked matchers
> _without_ climbing the chomsky hierarchy: can we be fast and
> convenient at the same time?
It's not unasked. I've asked it myself, in several variations. One
variation I particularly like is whether there is a (practical) way
to let the regexp compiler decide how far to climb the Chomsky
ladder (and not to clutter/limit the `regexp language' or `the
interface' with such performance considerations).
Thanks for your insightful posts.
-- tomas
- Re: Stupid module and pregexp questions, Thien-Thi Nguyen, 2003/10/24
- Re: Stupid module and pregexp questions, Thien-Thi Nguyen, 2003/10/24
- Re: Stupid module and pregexp questions, Thien-Thi Nguyen, 2003/10/24
- Re: Stupid module and pregexp questions, Tom Lord, 2003/10/24
- Re: Stupid module and pregexp questions, Thien-Thi Nguyen, 2003/10/26
- Re: Stupid module and pregexp questions,
tomas <=
- Re: Stupid module and pregexp questions, Dale P. Smith, 2003/10/27
- Re: Stupid module and pregexp questions, rm, 2003/10/27
- Re: Stupid module and pregexp questions, Robert Marlow, 2003/10/27
- Re: Stupid module and pregexp questions, Tom Lord, 2003/10/27
- Re: Stupid module and pregexp questions, Harri Haataja, 2003/10/29
- Re: Stupid module and pregexp questions, Tom Lord <address@hidden> To, 2003/10/27
- Message not available
- Re: Stupid module and pregexp questions, Thien-Thi Nguyen, 2003/10/27