The final parser composite is a non-deterministic recursive-descent parser with infinite look-ahead.
物是一个非确定性的无限递推分析器。
In computer terms, this rule is also known as recursive tree descent.
以计算机术语表述，这条规则也可以称作递归树下行。
It is caused by recursively descending a composite data structure in such a way that, sometimes, more than one step in the descent is taken in a single recursive call.
它是由递归下行复合数据结构引起的，这种下行方式有时在一次递归调用中要下行多级。
Since member items need to be valid objects prior to their inclusion in larger structures, the simplest recursive descent approach would not work.
由于在成员项所包含的内容出现在较大型的结构之前，成员项必须是有效对象，所以最简单的递归继承方法不起作用。
Typically, we store temporary variables, generated by our semantic actions, in our closure variables, as a means to pass information up and down the recursive descent.
典型地，我们在闭包里储存由我们的语义动作产生的临时变量，以之作为在递归下降中向上或向下传递信息的方法。
The final parser composite is a non - deterministic recursive - descent parser with infinite look - ahead.
最终分析器的合成物是一个非确定性的无限递推分析器。
The final parser composite is a non - deterministic recursive - descent parser with infinite look - ahead.
最终分析器的合成物是一个非确定性的无限递推分析器。
应用推荐