Download for Windows Premium
Publiciteit
recursive descent parser

Vertaling van "recursive descent parser" in Chinees

We konden deze vermelding niet vinden. Er worden benaderende resultaten weergegeven. Controleer je spelling of stel voor deze term aan het woordenboek toe te voegen.
递归下降解析器
Each nonterminal in a parsing expression grammar essentially represents a parsing function in a recursive descent parser, and the corresponding parsing expression represents the "code" comprising the function.
解析表达文法里面的每一个非终结符本质上表示递归下降解析器里面的一个解析函数 ,其对应的解析表达式展示了这个函数包含的代码内容。
A TDPL grammar can be viewed as an extremely minimalistic formal representation of a recursive descent parser, in which each of the nonterminals schematically represents a parsing function. Each of these nonterminal-functions takes as its input argument a string to be recognized, and yields one of two possible outcomes
解析表达文法里面的每一个非终结符本质上表示递归下降解析器里面的一个解析函数 ,其对应的解析表达式展示了这个函数包含的代码内容。 概念上,每一个解析函数接受一个输入字符串作为参数,返回以下其中一个结果:
The biggest change was to write a new recursive descent parser to replace the YACC-based parser that we've used for over 35 years.
这个巨大的改变需要写一个新的递归下降解析器来替换基于 YACC的解析器 ,YACC我们已经使用了超过35年之久。
The use of a recursive descent parser The use of Extended Backus-Naur Form (EBNF) to specify the syntax of a language
使用递归下降解析器 使用EBNF 指定语言的语法。
A packrat parser is a form of parser similar to a recursive descent parser in construction, except that during the parsing process it memoizes the intermediate results of all invocations of the mutually recursive parsing functions, ensuring that each parsing function is only invoked at most once at a given input position.
一个Packrat Parser[3] 是一种结构上类似于递归下降解析器的语法解析器,区别是在解析过程中,它会记下所有互相递归调用的函数的中间结果。
A query is parsed by a hand-written recursive descent parser. For example, ParserSelectQuery just recursively calls the underlying parsers for various parts of the query. Parsers create an AST. The AST is represented by nodes, which are instances of IAST.
查询由一个手写递归下降解析器解析。比如, ParserSelectQuery 只是针对查询的不同部分递归地调用下层解析器。解析器创建 AST。AST 由节点表示,节点是 IAST 的实例。
Any parsing expression grammar can be converted directly into a recursive descent parser. Due to the unlimited lookahead capability that the grammar formalism provides, however, the resulting parser could exhibit exponential time performance in the worst case. It is possible to obtain better performance for any parsing expression grammar by converting its recursive descent parser into a packrat parser, which always runs in linear time, at the cost of substantially greater storage space requirements.
所有的解析表达文法都能够被直接转化为递归下降解析器 (英语 : recursive descent parser ) 。 [3] 尽管如此,因为PEG公式提供了理论上不受限制的向前检查的能力,所以最终得到的解析器还是可以避免最坏情况下指数级时间复杂度 的。 通过保存增量解析步骤的结果和确保每一个解析函数在同一个输入位置只被调用一次,就可以把任意解析表达文法转化成一个Packrat Parser,可以实现线性的时间复杂度解析,其代价是足够大量的空间占用。
It is also possible to build LL parsers and LR parsers from parsing expression grammars, with better worst-case performance than a recursive descent parser, but the unlimited lookahead capability of the grammar formalism is then lost.
从解析表达文法建立LL剖析器 和LR剖析器 也是可行的,但是在这两种情况下,不受限制的向前检查的能力就不能用了。
Er zijn geen resultaten gevonden voor deze term.
Ga naar Premium voor toegang tot miljoenen vertaalvoorbeelden, onbeperkt woorden opslaan en leren, zonder advertenties.

Synoniemen voor recursive descent parser in het Engels

Woord & uitdrukking van de dag
Afbeelding van de dag
braid: weave of three or more strands
Ontdek het woord
Publiciteit

Resultaten: 8. Exact: 8. Verstreken tijd: 10 ms.