Every regular expression is logically equivalent to a state machine, and the parser of every regular expression implements a state machine.
逻辑上,每个规则表达式都等价于一个状态机,而每个规则表达式的语法分析器都实现这个状态机。
Each rule, in turn, consists of a regular expression and some code to be run when that regular expression is matched.
每一个规则依次包含一个正则表达式以及该正则表达式得到匹配时要运行的一些代码。
It represents a regular expression and provides the logic to match the regular expression against strings.
它表示一个正则表达式并提供了使正则表达式与字符串相匹配的逻辑。
应用推荐