片语

descendant combinator后代选择器

combinator programming组合子编程

Child Combinator大于号

category combinator分类组合程序

Paradoxical combinator不动点组合子

Parser CombinatorIn functional programming, a parser combinator is a higher-order function which accepts several parsers as input and returns a new parser as its output. In this context, a parser is a function accepting strings as input and returning some structure as output, typically a parse tree or a set of indices representing locations in the string where parsing stopped successfully.

combinator calculicombinator演算族

Y CombinatorY Combinator commonly refers to:

英汉例句

• Prepending a simple selector and combinator to a chain imposes additional matching constraints, so the subjects of a selector are always a subset of the elements matching the last simple selector.

  将简单选择符和组合符结合成链就增加了额外的匹配条件，因此选择符的主题总是那些符合最右端的简单选择符的元素的子集。

• While the child combinator targets direct children of another element, the Adjacent Sibling combinator targets an element that directly follows, but is separate from, a previous element.

  子选择符可以指向另外一个元素的子部，相邻选择符可以指向跟随的元素，但与前面的元素独立。

• In the original parser, expressions like 「5 + 5 + 5」 were acceptable owing to the rep combinator in the grammar definition for expressions (expr) and terms (term).

  在原来的解析器中，可以接受像「5 +5 +5」这样的表达式，因为语法中为表达式(expr)和术语(term)定义了rep组合子。

• The other newly supported combinator will be the Adjacent Sibling combinator, designated by a 「+」 symbol similarly placed between simple selectors.

  另外一个新支持的选择符将是相邻选择符，使用「+」符号。

• Toward that end, we need to change the parser combinator implementation to produce different objects during parse.

  对于该前端，我们需要更改解析器组合子实现，以便在解析期间生成不同的对象。

• To understand how this all works, we have to take a brief dive into the parser combinator implementation.

  为了理解其中的原理，我们必须简要了解解析器组合子的实现。