lookahead

Lookahead search is a well-known technique for improving greedy algorithms.

对于贪婪算法的改进，前向搜索是一种众所周知的技术。

In fact, many well designed languages are fully deterministic and require no lookahead at all.

事实上，许多精心设计的语言是完全确定性的，根本不需要前向环视。

A fast carry-skip adder is proposed based on variable-sized two-level block carry-lookahead logic.

提出了一种基于方块超前进位的快速进位跳跃加法器。

The prefix tree adder is useful in compound adder implementation. It is preferred over the ripple carry adder and the carry lookahead adder.

该加法器适用于复合型加法运算，优于脉动进位加法器和超前进位加法器。

Negative lookahead assertion. This is the opposite of the positive assertion; it succeeds if the contained expression doesn't match at the current position in the string.

前向否定界定符。与肯定界定符相反；当所含表达式不能在字符串当前位置匹配时成功。