Re: Re: A Regexp Assembler/Compiler

[PetaMem]

My guts say that such a mechanism does not exist, that the problem is unsolvable. If the problem is solvable, it's going to be incredibly hard.

I agree with Abigails intuition here, but only for the language space perl regexps span in general. Considering the examples I've given above, one sees, that there are regexps (hard ones) and regexps (next to trivial).

So my guts tell me, that for a certain subset of regexps this problem must have a more or less achievable solution, the more expression you'd like to handle the more "incredibly hard" it will get. But hey - then again it'll be just incredibly possible if you allow me the s///ing of a well known citation. :-)

Bye
 PetaMem