Afaict regex inside the cut assertions can backtrack, but once the engine left the assertion it will not try to match different text with it.
But the fact remains that you have to know quite some details regular expressions to get that working, so the approach with negated char classes is preferable.
In reply to Re^5: Can KMP be used to find the longest common subsequence? (ugh)
by moritz
in thread Can KMP be used to find the longest common subsequence?
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |