在上个世纪九十年代的早期，作为并行算法的演示案例，Leiserson小组的成员设计了一个在秒钟级就可以完成计算的国际象棋程序，并参加了1995年的计算机象棋大赛。
In the early 1990s, as a demonstration of the power of parallel algorithms, members of Leiserson's group designed a chess-playing program that finished second in the 1995 computer chess championship.
下面的示例用于通过一个实际案例演示该特性。
The following sample is intended to demonstrate this feature in a practical case.
正如本文的主要焦点是实现插件解析器，本文通过一个简单案例研究来演示它。
As the main focus of this article lies on the implementation of a plug-in parser, a simplified case study is used to demonstrate it.
应用推荐