摘要： 原文：维基百科链接There are at least three differentalgorithmsthat decide if and how a given regular expression matches a string.至少有三种算法可以用来确定给定的正则表达式是否匹配一个字符串。（1） 自动机The oldest and fastest rely on a result in formal language theory that allows everynondeterministic（不确定） finite automaton(NFA) to be transform 阅读全文