John Machin wrote:
> On 29/05/2006 7:46 AM, Sébastien Boisgérault wrote:
> > Paddy a écrit :
> >
> >> maybe this: http://www.pcre.org/pcre.txt and ctypes might work for you?
> >
> > Well finally, it doesn't fit. What I need is a "longest match" policy
> > in
> > patterns like "(a)|(b)|(c)" and NOT
On 29/05/2006 7:46 AM, Sébastien Boisgérault wrote:
> Paddy a écrit :
>
>> maybe this: http://www.pcre.org/pcre.txt and ctypes might work for you?
>
> Well finally, it doesn't fit. What I need is a "longest match" policy
> in
> patterns like "(a)|(b)|(c)" and NOT a "left-to-right" policy.
> Addit
Paddy a écrit :
> maybe this: http://www.pcre.org/pcre.txt and ctypes might work for you?
Well finally, it doesn't fit. What I need is a "longest match" policy
in
patterns like "(a)|(b)|(c)" and NOT a "left-to-right" policy.
Additionaly,
I need to be able to obtain the matched ("captured") subst
Very good hint ! I wouldn't have found it alone ...
I have to study the doc, but the "THE DFA MATCHING ALGORITHM" may do
what I need Obviously, I didn't expect the Perl-Compatible Regular
Expressions to implement
"an alternative algorithm, provided by the pcre_dfa_exec() function,
that operates in
maybe this: http://www.pcre.org/pcre.txt and ctypes might work for you?
(I was suprised to find out that PCRE supported POSIX but don't know
what version it supports or how well).
- Pad
--
http://mail.python.org/mailman/listinfo/python-list
Hi,
I'm searching for a POSIX 1003.2 compatible regular expression engine.
The Python binding "pregex" by Neal Becker may do the job, but I did
not manage to download it as the original link
ftp://ftp.ctd.comsat.com/pub/
seems dead.
Does any old-timer () have a copy of this package ?
Cheers,
SB
