Brent Dax wrote:
> Honestly, though, I'm no longer sure the full regex engine is a good idea.
> A fast index op, a fast ord op, a character class op, and the intstack is
> really all that's needed to make a regex engine from plain Parrot opcodes.
I agree with you on one level. That is enough to m
Benjamin Goldberg:
> Since I don't see anything to save/restore the instack on subroutine
> calls, I am wondering what happens if a regex has a (?{ CODE }), and
> that CODE calls a regex. Are we garunteed that after a regex completes
> (either succeeds or fails) that the intstack is in the same st
Brent Dax wrote:
> Leopold Toetsch:
> # 2) For bitmaps I would provide a bitlist.c with functions for setting
> # and testing bits. This bitlist would be based on list, so it
> # should be
> # fast enough and had no limits WRT unicode chars.
>
> Note that the "Bitmaps" used by rx are only bitmaps
Leopold Toetsch:
# 2) For bitmaps I would provide a bitlist.c with functions for setting
# and testing bits. This bitlist would be based on list, so it
# should be
# fast enough and had no limits WRT unicode chars.
Note that the "Bitmaps" used by rx are only bitmaps within US-ASCII, to
keep siz
