But since the the regexes will always be anchored I can always find out automatically if a match has started by using $match = m/\G(?{ $started = 1 })$re/. Now a way to find the longest submatch that was found (but discarded) would be enough.
Or is there any other way to match against a stream?
In reply to Re^2: Did regex match fail because of "end of string"?
by moritz
in thread Did regex match fail because of "end of string"?
by moritz
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |