Regular Expressions
 

Every once in awhile I run across a situation where I wish I could use regular expressions in GS2. Since this is no trivial task to implement myself, not to mention it would most likely be slow if not done at a language level, it would be really nice if regular expressions were added into GS2.

I completely agree. I have also come across several situations where Regex would make my life so much easier. Seeing as how several libraries offer this in C++, it should not be so difficult to implement in GScript at all.

Yeah, I support this.

Bump!
There's a couple things I hope to use regex for that would make my life so much better.
Better living through regular expressions! :D

Could you show some theory usage of how it would work? I haven't touched regex before.

Lua syntax, it's from one of my WoW addons:
Basically, this replaces the display format of the channel escape sequence (WoW stuff) at the start of the string msg (if any escape sequence exists) with a predefined new format stored in channelFormat.
WoW channel escape sequences work like this:
If you want to know some more details, either ask, or check out patterns on the Lua website. Also, as far as I know, Lua implements regular expressions a tad differently compared to other languages, so you might also want to check out the PHP documentation.

I've never needed regex for coding anything in Graal. Not to mention they can lead to some seriously inefficient code if you don't know what you are doing (e.g., when checking against a non-regular language, unlimited backreferences are an NP-complete problem).

I've ran into a couple situations where I really wish I had it. I think getstringkeys() is probably the most common.

I'm familiar with regular expressions as they're used in Python. They're a tad bit complicated to learn, but very useful for searching for patterns.

And inefficient code is always an issue, no matter what you do, so it's not really a reason to not support this. I personally could find good use for regex.

I'm just saying that regex is particularly complex and therefore more prone to inefficiencies.

Yeah, but user error is user error, no reason not to have it :)

Pft, who needs regexps when you could instead build some awesome parser combinator system.

Whoever implements parsec first wins a cookie!

Bumping this because I just ran into a place where this would be perfect.

Bumping this too!!