Now that I'm able to compile regices in my byte-oriented re engine, I'm looking at how to "execute" the matches.
I noticed in the [Boost docs][1] that describes the left-most longest rule, it said: > 4. Find the match which has matched the first sub-expression in the > leftmost position, along with any ties. If there is only on such > match possible then return it. I'm confused, and I can only think of the following explanation. That is: - it didn't catch up to what we meant by "subexpression" as clarified in [Bug 1911][2] Otherwise, it would imply parentheses have priority to fall towards the left. Is that explanation plausible and correct? [1]: https://www.boost.org/doc/libs/latest/libs/regex/doc/html/boost_regex/syntax/leftmost_longest_rule.html [2]: https://www.austingroupbugs.net/view.php?id=1911
