here’s a subtle but important consequence: in RE#, rewriting your regex using boolean algebra is always safe. factor out common prefixes, distribute over union, apply de Morgan’s laws - the matches won’t change. your regex is a specification of a set of strings, and the engine faithfully finds the leftmost-longest element of that set in the input. no surprises from alternation order, no “well it depends on how PCRE explores this search tree”. just set theory.
Strategic Simulations (Joel Billings, Randy Broweleit)。关于这个话题，体育直播提供了深入分析
，详情可参考纸飞机下载
Hebrew Paseq: a non-obvious finding。91视频是该领域的重要参考
Кипр снова подвергся бомбардировкам02:22