英语释义

1. doctor of fine arts

2. delayed funds availability

片语

DFA evaluationDFA评价

DFA-abbr. 美术博士（ Doctor of Fine Art）

DFA methodDFA方法

dfa toolsdfa工具

Dfa RecordsDFA Records is an independent record label and production team, launched in September 2001 by Mo' Wax co-founder Tim Goldsworthy, musician James Murphy, and manager Jonathan Galki

min DFA最小确定有穷自动机

The DFA表演者

英汉例句

• move() returns the state the DFA transitions to upon hitting a given XML element.

  一旦命中给定的XML元素，move()返回DFA转换的状态。

• I first encountered DFA several years ago when I worked on regular expressions, but it has been at least three years since I last used them so I spent some time researching the subject.

  几年前，我在处理正则表达式时，第一次遇到了DFA，但是我已经至少有三年没有用过它，所以我花了一些时间来研究它。

• If you have a copy of the book handy, the DFA construction is algorithm 3.5.

  如果您手边有这本书，那么这个dfa构造使用的是这本书中所讲的算法3.5。

• Deciding what to do when matching an XPath and how to assign priorities is not the responsibility of the DFA compiler.

  当匹配XPath时，DF a编译器是不负责确定要做什么以及如何分配优先级这些事。

• Fortunately there are well-documented algorithms on how to construct the transition table for any transition diagram, so the DFA effectively solves the problem.

  幸运的是，在对任意一个转换图构造转换表方面，有一些成文的算法，这样，DFA就可以有效地解决这个问题。

• To test the DFA construction, I had to simulate the proxy and the front end.

  为了测试DF A构造，我必须模拟代理和前端。

• The circles represent the states that the proxy will go through; the arrows are labelled with the elements that cause the DFA to transition.

  圆圈表示代理将经过的状态；用一些促使dfa转换的元素来标注箭头。

• Most of the development work for this column has been in implementing the DFA construction algorithm introduced last month.

  这篇专栏文章中所涉及的大多数开发工作都是在实现上月所介绍的DF A构造算法。

• The DFA construction algorithm converts this parse tree into a set of states, as the previous column explains.

  如前一篇专栏文章中所解释的，DF A构造算法将该解析树转换成一组状态。

• The number of states grows when the DFA attempts to recognize more XPaths.

  当DFA试图识别更多的XPath 时，状态的数量也会随之增长。

• The DFA is a popular algorithm to construct a state machine to recognize patterns.

  DFA是一个深受大家喜爱的算法，用来构造一个状态机来识别模式。

• CreateDFA is a direct implementation of the DFA construction algorithm discussed in the previous column.

  createDFA是以前专栏文章中所讨论过的DF a构造算法的直接实现。

• I need to finalize the DFA compilation before I have anything new worth Posting.

  在值得张贴一些新东西之前，我需要最终处理dfa编译。

• Therefore it does not know which method to call when the DFA matches.

  因此，它不知道在dfa匹配时要调用哪个方法。

• However, you can already appreciate the power of using a compiler: the DFA construction algorithm takes care of all the state management.

  然而，您可能已经意识到了使用编译器的强大功能：DFA构造算法来负责所有状态管理。

• The problem is that if the DFA recognizes sect1/simpara, it will never explore the other branch (simpara/ulink). The above two XPaths really are equivalent to

  如果DFA 识别出 sect1/simpara ，则它不会再探究另一个分支（simpara/ulink ）。

• Without repeating the discussion from that column, a DFA is a structure to which XPaths can be compiled efficiently.

  不必重复那篇专栏文章所讨论的内容，DFA是可以高效编译XPath的结构。

• In fact, I could argue that I would have finished writing a buggy, yet not-well-tested version of the DFA compiler this month if I hadn't spent so much time on automated tests.

  事实上，如果不是在自动化测试方面花了大量的时间，我可能认为在这个月本可以编写完一个还有一些错误且没有经过良好测试的DF A编译器的版本。

• 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)。

• Recall from our discussion last month that a DFA is a transition diagram.

  回忆上个月我们所讨论的，DFA是一个转换图。

• From the discussion in the last column, you may recall that the algorithm to construct a DFA expects a parse tree as input.

  从上一篇专栏文章所讨论的内容中，您可以回忆起，构造DFA的算法需要一棵解析树作为输入。