[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: On refining regexp by adding exceptions systematically
|
From: |
Vassil Nikolov |
|
Subject: |
Re: On refining regexp by adding exceptions systematically |
|
Date: |
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).
---Vassil.
--
Garbage collection is charged at 0.19e-9 cents a cons. Bulk rates
are also available: please contact memory management for details.