Am 01.10.2015 um 14:33 schrieb Eric Covener:
On Thu, Oct 1, 2015 at 6:26 AM, Rainer Jung <[email protected]> wrote:
Since it gets more common to use the expression parser for string operations
and not only for boolean checks, I think it would be useful (and powerful)
to support
s/PATTERN/REPLACEMENT/FLAGS
and allow back references in REPLACEMENT. The operation would not try to do
the replacement in place but create a new string according to the given
PATTERN and REPLACEMENT.
I had a quick look at the flex and bison files which generate lexer and
parser but must admit that it wasn't immediately obvious to me how to do it.
I can try harder but first wanted to ask if there are any volunteers who
know that technology better than me. Stefan (Frisch)? Others?
Otherwise I'll try myself (and learn new stuff on the way).
I've tried and failed to hack the exact same thing in a few times. I
agree it would be great to have.
OK, at least an encouragement for me to have a closer look.
Regards,
Rainer
