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.
每一个规则依次包含一个正则表达式以及该正则表达式得到匹配时要运行的一些代码。
A regular expression describes the format of a string: With the simplest form of regular expression, you input the text that you want to match.
正则表达式描述字符串的格式：使用最简单的正则表达式格式，您可以输入您希望匹配的文本。
It represents a regular expression and provides the logic to match the regular expression against strings.
它表示一个正则表达式并提供了使正则表达式与字符串相匹配的逻辑。
A regular expression followed by? Matches zero or one occurrence of the regular expression.
号后面的正则表达式可以匹配这个正则表达式的零次或一次出现。
A regular expression followed by + matches one or more occurrences of the regular expression.
号后面的正则表达式可以匹配这个正则表达式的一次或多次出现。
The nice thing about the regular expression is the ability to customize the regular expression used.
正则表达式的一个优点是能够定制所使用的正则表示式。
This USES the regular expression module (re) to create a compiled regular expression from the regular expression the user enters in line 8.
它使用正则表达式模块(re)，由用户在第8行输入的正则表达式创建已编译的正则表达式。
To use a regular expression in Squirrel Shell, you define the regular expression, compile it, make a comparison, then iterate over the results, if any.
要在SquirrelShell中使用正则表达式，需要先定义正则表达式，对其进行编译，进行比较，然后再迭代结果(如果有的话)。
Section 6.5 deals with regular expression string generation, which is a commonly asked question: "Given a regular expression, how do you find all the strings that match it?"
节介绍的是正则表达式字符串的生成问题，这是一个经常被问到的问题：“给定一个正则表达式，我们应该如何查找与之匹配的所有字符串呢？”
For example, the regular expression a will match the string abcdcba twice (the first and last a) and so will the regular expression b.
例如，正则表达式a匹配字符串abcdcba两次，正则表达式b 也是一样。
Alternatively, you can try to build the regular expression pattern yourself using the regular expression Builder.
另外，也可以使用Regular ExpressionBuilder自己构建正则表达式模式。
This thesis introduces the arithmetic design that how regular expression switches to minimum state DFA and the method how finite automata switches to regular expression.
本文主要介绍基于编译器构造技术中的由正规表达式到最小化dfa的算法设计和实现技术，以及自动机转换正规式的方法。
The regular expression is first translated to the compiler's regular expression opcodes.
正则表达式首先被翻译为编译器的正则表达式操作码。
The regular expression object is an object that contains a regular expression pattern along with flags that identify how to apply the pattern.
规则运算式物件是包含规则运算式模式以及旗标的一个物件，而旗标会识别如何套用模式。
If you are using a regular expression pattern that has already been defined in another static method call, the regular expression engine will retrieve it from the cache.
如果您使用其他静态方法呼叫中已定义的规则运算式模式，规则运算式引擎就会从快取中撷取这个规则运算式模式。
A regular expression object contains the pattern of a regular expression.
核心对象一个正则表达式对象包含了匹配模式。
This error generally occurs when a regular expression has been included in a search string but the syntax for the regular expression contains errors.
当正则表达式已包括在搜索字符串中而该正则表达式的语法包含错误时，通常会发生此错误。
This error generally occurs when a regular expression has been included in a search string but the syntax for the regular expression contains errors.
当正则表达式已包括在搜索字符串中而该正则表达式的语法包含错误时，通常会发生此错误。
应用推荐