它依次通过每个组合进行处理，尝试将输入形式与模式进行匹配，如果匹配的话，它就产生相关联的展开形式。
It proceeds through each one, trying to match the input form to the pattern and, if it matches, it produces the associated expansion.
这些模式匹配算法可以寻找并标识在内存转储之间增长最快的聚合数据结构(按照类似的所属权结构组合在一起)。
These pattern matching algorithms seek to identify aggregated data structures (grouped together by similarity of ownership structure) that are growing the most in between the memory dumps.
SPARQL的基本范例就是模式匹配，其设计原理为跨web工作，处理来自不同来源的数据组合，并且具有灵活性。
The fundamental paradigm for SPARQL is pattern matching and it is designed to work across the Web on data combined from disparate sources and to be flexible.
类似于vi和Emacs的编辑器将模式匹配与替换组合，从而将查找和替换文本组合成一步操作。
Editors such as vi and Emacs combine pattern matching and substitution to find and replace text in one fell swoop.
在这样的情况下，最好的做法是混合最匹配的模式，开发出新的组合或定制模式。
In such cases, it is perfectly valid to mix and match top level patterns to develop new composite or custom patterns.
在这样的情况下，最好的做法是混合最匹配的模式，开发出新的组合或定制模式。
In such cases, it is perfectly valid to mix and match top level patterns to develop new composite or custom patterns.
应用推荐