Can DFA regex engines handle atomic groups?
DFA的正则表达式引擎可以处理原子团？
The DFAFactory class compiles a DFA from the parse tree.
DFAFactory类从该解析树编译dfa。
Two related elements come into play when constructing the DFA.
当构造DF A时，两个相关元素发挥了作用。
Therefore it does not know which method to call when the DFA matches.
因此，它不知道在dfa匹配时要调用哪个方法。
This is the most simple DFA realized, when used to modify file paths!
这是最简单的DFA实现，使用时注意修改文件路径！
The number of states grows when the DFA attempts to recognize more XPaths.
当DFA试图识别更多的XPath 时，状态的数量也会随之增长。
In the empirical tests, we found that the DFA model still has some bugs.
在实证测试中，我们发现该模型仍然存在一些错误。
As you will see, it is possible to automatically convert an NFA into a DFA.
正如您将看到的，有可能自动地将NF A转换成dfa。
Diaphragms satisfy all the sanitary standards and conditions of DFA and UPS.
膜片符合DFA及UPS等权威机构对药品和食品行业规定的安全标准。
Design for Assembly (DFA) is an important enabler in concurrent engineering.
摘要面向装配的设计是并行工程中的一项重要的使能技术。
I need to finalize the DFA compilation before I have anything new worth Posting.
在值得张贴一些新东西之前，我需要最终处理dfa编译。
move() returns the state the DFA transitions to upon hitting a given XML element.
一旦命中给定的XML元素，move()返回DFA转换的状态。
As discussed last month, I plan to use Deterministic Finite Automaton (DFA) to compile the proxy.
如上个月所讨论的，我计划用确定性有限自动机(Deterministic Finite Automaton,DFA)来编译该代理。
CreateDFA is a direct implementation of the DFA construction algorithm discussed in the previous column.
createDFA是以前专栏文章中所讨论过的DF a构造算法的直接实现。
Finally, we present the application of car drive panel assembly by use of DFA in concurrent engineering.
介绍了在并行工程理念下d FA技术在轿车驾驶舱装配开发中的应用。
The DFA construction algorithm converts this parse tree into a set of states, as the previous column explains.
如前一篇专栏文章中所解释的，DF A构造算法将该解析树转换成一组状态。
In this paper an attack model based on DFA is constructed and Z is employed to formally depict network attack.
文章建立了基于DFA的攻击模型，并在此基础上利用Z语言对之进行了有效的形式化描述。
A constructive minimization algorithm of DFA easy to be implemented is presented based on the above discussion.
基于上述理论分析，给出了DFA最小化算法的一个容易实现的构造性描述及示例。
In the last column, we wrote the logic to compile a set of XPath in a so-called Deterministic Finite Automaton or DFA.
在上一篇专栏文章中，我们编写了在所谓的“确定性有限自动机(Deterministic Finite Automaton或简称dfa)”中编译一组XPath的逻辑。
Most specifically, in the last column I reviewed algorithms to compile a so-called Deterministic Finite Automaton (DFA).
讲得更具体些，在上篇专栏文章中，我回顾了编译所谓“确定性有限自动机(Deterministic Finite Automaton，简称dfa)”的一些算法。
Without repeating the discussion from that column, a DFA is a structure to which XPaths can be compiled efficiently.
不必重复那篇专栏文章所讨论的内容，DFA是可以高效编译XPath的结构。
Deciding what to do when matching an XPath and how to assign priorities is not the responsibility of the DFA compiler.
当匹配XPath时，DF a编译器是不负责确定要做什么以及如何分配优先级这些事。
From the discussion in the last column, you may recall that the algorithm to construct a DFA expects a parse tree as input.
从上一篇专栏文章所讨论的内容中，您可以回忆起，构造DFA的算法需要一棵解析树作为输入。
Most of the development work for this column has been in implementing the DFA construction algorithm introduced last month.
这篇专栏文章中所涉及的大多数开发工作都是在实现上月所介绍的DF A构造算法。
The multi-pattern algorithm based on Deterministic Finite Automata(DFA) is commonly used in deep packet inspection systems.
基于确定性有限自动机（DFA）的多模式匹配算法被广泛用于数据包深度检测系统中。
By analyzing the theory of Deterministic Finite Automata (DFA) and ARS, a DFA model based on animal character is established.
通过对有穷自动机理论与动物识别系统进行分析，建立了一个基于动物特征的确定型有穷自动机的模型。
However, you can already appreciate the power of using a compiler: the DFA construction algorithm takes care of all the state management.
然而，您可能已经意识到了使用编译器的强大功能：DF A构造算法来负责所有状态管理。
To solve permeable loss problem in Bohai Gulf oilfield, a new oil-soluble temporary plugging agent DFA for workover fluid was worked out.
为解决渤海湾海上油田渗透性漏失“能堵不能解”的技术难题，研制出新型油溶性暂堵剂DFA。
It has three data fields for the list of QNames the DFA recognizes: (symbols), the transition table (dtran), and the accepting states (astate).
它有三个分别用于dfa识别的QName列表的数据字段：(symbols)、转换表(dtran)和接受状态(astate)。
It has three data fields for the list of QNames the DFA recognizes: (symbols), the transition table (dtran), and the accepting states (astate).
它有三个分别用于dfa识别的QName列表的数据字段：(symbols)、转换表(dtran)和接受状态(astate)。
应用推荐