Balanced match with std.regex
Jakob Ovrum via Digitalmars-d-learn
digitalmars-d-learn at puremagic.com
Mon Dec 14 17:29:39 PST 2015
On Tuesday, 15 December 2015 at 01:07:32 UTC, Chris Wright wrote:
> I don't think so.
> std.regex looks like it implements only a deterministic finite
> automaton, whereas what you are looking for requires a
> push-down automaton. It just so happens that a few popular
> regex libraries implement PDAs rather than DFAs (and have
> associated changes to their regex syntax to make it work,
> albeit inelegantly).
Thanks, that makes sense.
String manipulation in D without regex is pretty nice anyway, so
it's not a big loss.
More information about the Digitalmars-d-learn