Would there be interest in a SERIOUS compile-time regex parser?
Michael Butscher
mbutscher at gmx.de
Mon Oct 16 13:41:20 PDT 2006
Don Clugston wrote:
> The question is -- would this be worthwhile? I'm really not interested
> in making another toy.
> It's straightforward, but tedious, and would double the length of
> std.regexp.
Maybe it would be simpler, but similar effective, to add some
persistence functionality to std.regexp.RegExp.
This could mean to convert an instance of RegExp to a byte array, cache
it in a file, later load the array back and recreate the instance.
So the "compilation" of the RE to its opcodes is done only once and
program initialization becomes faster.
Michael
More information about the Digitalmars-d
mailing list