Re: [Boost-users] [Regex] Is it possible to have longest match and non-marking brackets? subexpression (to use later instead of its index)?

In Boost::regex, is it possible (by setting flags) to set up a syntax which is like boost::regex::extended in that it finds the longest match, but which also supports non-marking brackets i.e. (? ... ) ?

Kind of: you need to compile the expression as a Perl regex, then pass match_posix to the regex algorithm(s) to tell the matcher to find the leftmost longest match. Be aware that POSIX matches tend to be quite a bit slower than Perl style matches on the whole. John.