• For HC, the parse tree represents an XPath.

    对于HC,该解析树表示一个XPath。

    youdao

  • The DFAFactory class compiles a DFA from the parse tree.

    DFAFactory类从该解析树编译dfa。

    youdao

  • Your application could do more interesting things with the parse tree.

    您的应用程序可以用解析树做更多有趣的事情。

    youdao

  • A Doclet has a static start method and takes the parse tree as an argument.

    Doclet有静态start方法,并将解析树作为参数。

    youdao

  • InfoQ: With the ParseTree gem, one can access the parse tree of a class or method.

    InfoQ:我们可以使用ParseTreegem包访问一个类或一个方法的解析树。

    youdao

  • The stap process begins with a translation of the script into a parse tree (pass 1).

    stap流程从将脚本转换成解析树开始(pass 1)。

    youdao

  • Write client-side code to walk and evaluate the parse tree that's produced at runtime.

    编写客户机端代码以遍历在运行时生成的解析树并对其求值。

    youdao

  • Given the parse tree, you apply the algorithm in Listing 3 to compute the transition function.

    给定解析树,可以应用清单3中的算法来计算转换函数。

    youdao

  • Working with a parse tree representation also makes debugging easy and speeds development time.

    使用解析树表示还会使调试变得更容易,并缩短开发时间。

    youdao

  • I'll explore that in more detail once you've looked at JJTree and its parse tree representations.

    当您研究过JJTree及其解析树表示后,我将对此做更详细的研究。

    youdao

  • The first approach is to delay all semantic actions until the whole parse tree is constructed.

    第一种做法是延迟所有语意动作,直到建立完整的剖析树。

    youdao

  • In other words, this governs the shape and content of the parse tree that's constructed by the parser.

    换句话说,该构造管理由解析器构造的解析树的形状和内容。

    youdao

  • InfoQ: How did you make your technical choice like using parse tree for parsing and building AST Ruby?

    InfoQ:你如何做技术上的选择,比如解析使用parse tree,以及构建ASTRuby ?

    youdao

  • We also propose a BaseNP-based analyzing technique to extract syntactic information from a parse tree.

    信息 利用上,我们提出了基于基本名词短语的分析方法。

    youdao

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

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

    youdao

  • I'll come back to this in more detail when I talk about the JJTree tool and parse tree representations in Part 2.

    在第2部分谈论有关JJTree工具和解析树表示时,我将回过头来更详细地讨论这一内容。

    youdao

  • The method accepts a parse tree (as an XPathNode object) as parameter and, for now, returns an instance of DFATable.

    目前,该方法接受解析树(作为一个XPathNode对象)作为参数,并返回DFATable的实例。

    youdao

  • InfoQ: Could you tell us the advantage of using JRuby over parse tree or any other solutions, to exploit Ruby code?

    InfoQ:你能告诉我们使用JRuby而不是parse tree或者其他解决方案来解析ruby代码的优势吗?

    youdao

  • Usually, using SimpleParse means generating a parse tree in one function call, then traversing this tree in separate code.

    一般来说,使用SimpleParse就意味着在一个函数调用中生成一个解析树,然后在分开的代码中遍历这个树。

    youdao

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

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

    youdao

  • The axpath() method returns what is known as an augmented parse tree -- a parser tree with one extra node for the END_MARK.

    axpath()方法返回称之为扩张的解析树 ―该解析树额外地带有一个表示 END_MARK 的节点。

    youdao

  • The parser is the software that takes those meaningful words and builds a parse tree out of them by recognizing their type and purpose.

    解析器是一种软件,它从文本获得那些有意义的单词,并通过识别这些单词的类型与用途,从中构建解析树。

    youdao

  • The alternative (not explored here) is for productions to contribute only SimpleNode nodes to the parse tree and not subclasses thereof.

    备用方法(不在这里研究)是结果只将SimpleNode节点提供给解析树,而不是它的子类。

    youdao

  • Compared with the conventional parse tree, this representation not only consumes less space, but also is faster for structure matching.

    这种表示比传统分析树不仅空间较小,而且进行结构匹配的速度快。

    youdao

  • Target parsing can be reasonably fast and does not generate a memory-consuming parse tree, but all events fire for all elements in the data.

    目标解析可以实现合理的速度并且不会生成消耗内存的解析树,但是在数据中为所有元素触发事件。

    youdao

  • I'll note before we go any further that the terms parse tree and abstract syntax tree (or AST) describe very similar grammatical structures.

    在我们继续之前,我要特别提一下,术语解析树和抽象语法树(或ast)描述了非常相似的语法结构。

    youdao

  • The single quotation mark in front of the null list is used to tell Scheme that you are using as data and not as a part of your parse tree.

    空列表前面的单引号用来告诉scheme您正在使用作为数据,而不是用它作为解析树的一部分。

    youdao

  • Walking through the parse tree at runtime with a good debugger is another invaluable adjunct to understanding how tree building works in JJTree.

    使用好的调试器在运行时遍历解析树是另一个宝贵的辅助方法,它有助于理解树构建在JJTree中是如何工作的。

    youdao

  • ParseTree is a library that allows to access the parse tree of Ruby code - either Ruby source code or Ruby code already loaded in the interpreter.

    ParseTree是一个用来访问Ruby代码解析树的程序库,这个Ruby代码可以是源代码,也可以是已经加载到解释器的代码(即实时访问)。

    youdao

  • ParseTree is a library that allows to access the parse tree of Ruby code - either Ruby source code or Ruby code already loaded in the interpreter.

    ParseTree是一个用来访问Ruby代码解析树的程序库,这个Ruby代码可以是源代码,也可以是已经加载到解释器的代码(即实时访问)。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定