lookahead 中文意思是什麼

lookahead 解釋
向前看
  1. The biggest limitation is that yacc is limited to one token of lookahead

    最大的局限在於， yacc被限定為一個預讀標記。
  2. Zero - width negative lookahead assertion

    零寬度負預測先行斷言。
  3. Zero - width positive lookahead assertion

    零寬度正預測先行斷言。
  4. Nonbacktracking lookahead and lookbehind

    非回溯預測先行和追溯
  5. Provides information about regular expression lookahead and lookbehind behavior

    提供關于正則表達式預測先行和追溯行為的信息。
  6. Assertions do not change : lookahead looks to the right ; lookbehind looks to the left

    斷言不改變：預測先行向右搜索；回顧后發向左搜索。
  7. A subexpression that performs a positive lookahead search, which matches the string at any point where a string matching

    執行正向預測先行搜索的子表達式，該表達式匹配處于匹配
  8. The following regular expression, which is an example of a positive lookahead, matches windows 95, windows 98, and windows nt

    下面的正則表達式（這是一個正向預測先行的示例）匹配windows 95 、 windows 98和windows nt ：
  9. A positive lookahead, which is specified using ?, matches the search string at any point where a matching regular expression pattern in parentheses begins

    正向預測先行使用? =指定，它匹配處于括號中匹配正則表達式模式的起始點的搜索字元串。
  10. It also pioneered lookahead, pipelining, branch prediction, multiprogramming, memory protection, generalized interrupts, and the 8 - bit byte - and more

    這個系統倡導了很多方面的技術，例如：流水線，程序分支預測，多線程編程，內存保護，通用中斷， 8位位元組，等等。
  11. Carry lookahead generator

    先行進位生成程序
  12. A subexpression that performs a negative lookahead search, which matches the search string at any point where a string not matching

    的字元串的起始點的搜索字元串。它是一個非捕獲匹配，即不能捕獲供以後使用的匹配。
  13. Lookaheads do not consume characters, that is, after a match occurs, the search for the next match begins immediately following the last match, not after the characters that comprised the lookahead

    預測先行不佔用字元，即發生匹配后，下一匹配的搜索緊隨上一匹配之後，而不是在組成預測先行的字元后。
  14. Moreover, according to the performance analysis, a dynamic modify lookahead algorithm is presented to solve the problem of impaction of lookahead on system performance. a dynamic execution rate regulation algorithm is presented to reduce the retraction rate for optimistic federate. the test result showed that these two algorithms could improve system performance

    考慮到時間管理部分對邦元程序性能的影響，本文還針對保守邦元中lookahead的設置對系統性能的影響，提出了lookahead的動態修正演算法；針對影響樂觀邦元性能的關鍵因素，提出了動態調整邦元執行速度的演算法來控制回卷概率。
分享友人
分享到 Line

分享到臉書