[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: On refining regexp by adding exceptions systematically
From: |
Alan Mackenzie |
Subject: |
Re: On refining regexp by adding exceptions systematically |
Date: |
Sun, 6 Oct 2002 07:48:43 +0000 |
User-agent: |
tin/1.4.5-20010409 ("One More Nightmare") (UNIX) (Linux/2.0.35 (i686)) |
Vassil Nikolov <vnikolov@poboxes.com> wrote on 05 Oct 2002 23:02:02
-0400:
> On Sat, 5 Oct 2002 13:31:24 +0000, Alan
> Mackenzie<none@example.invalid> said:
> AM> Regular expressions are designed to find string expressions which are,
> AM> well, regular.
> A minor note: IIRC, `regular' means that the language defined by the
> expression can be handled by a finite automaton (a stack is not
> needed).
Hmmm. I was sort of dimly aware of that when I wrote the above. What's
really needed is word meaning "devoid of grotesquely shaped sticky-out
bits" but which isn't "regular".
> ---Vassil.
--
Alan Mackenzie (Munich, Germany)
Email: aacm@muuc.dee; to decode, wherever there is a repeated letter
(like "aa"), remove half of them (leaving, say, "a").