back to all posts
one optimization that i didn’t mention in the previous post but exists in both versions is skip acceleration. almost all serious regex engines have some form of this - the idea is simple: many states will self-loop on the majority of input bytes. for example, .* loops back to itself on every byte except \n - so why run the DFA transition 999 times when you can look up a whole chunk of the input in parallel and jump directly to the next \n? going back to the matching loop pseudocode from the previous post:
。业内人士推荐wps作为进阶阅读
США впервые ударили по Ирану ракетой PrSM. Что о ней известно и почему ее назвали «уничтожителем» российских С-400?20:16
Iran’s own water supply at risk