At 11:10 AM 11/26/2001 -0800, Brent Dax wrote:
>Dan Sugalski;
># What I really want to know is whether using ops to do regexes
># is feasable.
># After that we'll work on programmatically generating the op stream.
>
>There are definitely some weaknesses to it (for example, it's hard to do
>operati
Dan Sugalski;
# What I really want to know is whether using ops to do regexes
# is feasable.
# After that we'll work on programmatically generating the op stream.
There are definitely some weaknesses to it (for example, it's hard to do
operations on 'optimized' forms of things, like using bitmaps
At 07:34 PM 11/25/2001 -0800, Brent Dax wrote:
>Dan Sugalski:
># I realize that benchmarking the RE engine's a pain, what with
># no GC so we
># leak until we blow memory and die, but...
>#
># I'd like to take a series of regexes that exercise various bits of the
># perl 5 engine and time them aga
On Sun, 25 Nov 2001 19:34:15 -0800, Brent Dax wrote:
>Perl 5's REs will always appear faster because Perl 5 has an
>intelligent, optimizing regex compiler. For example, take the following
>simple regex:
>
> /a+bc+/
>
>pregcomp will optimize that by searching for a 'b' and working outwards
Bryan C. Warnock:
# On Sunday 25 November 2001 11:09 pm, Brent Dax wrote:
# > Not exactly.
# > It finds the 'a', then the 'abc', then tries the match. My mistake.
# > Still, that's a hell of a lot more intelligent than just 'proceeding
# > dumbly left-to-right'.
#
# It shows up better if you thr
On Sunday 25 November 2001 11:09 pm, Brent Dax wrote:
> Not exactly.
>
> C:\perl572\perl\win32>perl -mre=debug -e "print 'xaaabx'=~/a+bc+/"
>
> Guessing start of match, REx `a+bc+' against `xaaabx'...
> Found floating substr `abc' at offset 3...
> Found anchored substr `a' at offset 1
Bryan C. Warnock:
# On Sunday 25 November 2001 10:34 pm, Brent Dax wrote:
# > Perl 5's REs will always appear faster because Perl 5 has an
# > intelligent, optimizing regex compiler. For example, take
# the following
# > simple regex:
# >
# > /a+bc+/
# >
# > pregcomp will optimize that by sea
On Sunday 25 November 2001 10:34 pm, Brent Dax wrote:
> Perl 5's REs will always appear faster because Perl 5 has an
> intelligent, optimizing regex compiler. For example, take the following
> simple regex:
>
> /a+bc+/
>
> pregcomp will optimize that by searching for a 'b' and working outwa
Dan Sugalski:
# I realize that benchmarking the RE engine's a pain, what with
# no GC so we
# leak until we blow memory and die, but...
#
# I'd like to take a series of regexes that exercise various bits of the
# perl 5 engine and time them against the equivalent perl 6 RE
# code. I think
# it's i
