寻找在各种情况下可能的最长匹配。如果只有一个这样的匹配，那么就返回它。
Find the longest of the possible matches, along with any ties. If there is only one such possible match then return it.
在按内容寻址的存储器中应用的一种方法和电路，用于发现与搜索的数据具有最长匹配的字。
A method and circuit to be applied in content addressable memories for finding a word the longest match to the searched data.
它选择最长的匹配，从初始字符串的开始处除去，然后返回结果。
It selects the longest match, removes it from the beginning of the original string, and returns the result.
lex依次尝试每一个规则，尽可能地匹配最长的输入流。
Lex tries each rule in order, matching the longest stream of input it can.
常见的问题是，一个规则匹配太多的文本；更糟糕的是，由于lex倾向于匹配它能找到的最长的文本，这可能导致匹配的是一个完全不适当的规则。
A common problem is having a rule match too much text; worse, since lex prefers the longest match it can find, this can result in a totally inappropriate rule being matched.
然后，bash 取得MYVAR，找到从字符串 "foodforthought.jpg"开始处开始、且匹配通配符 "*fo"的最长 子字符串，然后将其从字符串的开始处截去。
Then, bash took MYVAR, found the longest substring from the beginning of the string "foodforthought.jpg" that matched the wildcard "*fo", and chopped it off the beginning of the string.
在各种情况下，寻找匹配第一个子表达式最长的匹配。如果只有一个这样的匹配，就返回它。
Find the match which has the longest match for the first sub-expression, along with any ties. If there is only one such match then return it.
指示对传入消息的地址执行最长前缀匹配的筛选器。
Indicates a filter does the longest prefix matches on the address of an incoming message.
如何利用模式匹配理论，根据串的最大匹配算法思想实现系统流程中最长地址数据优先拆分。
How to use the patter matching theory based on bunch most matching arithmetic to achieve furthest address data first to split in the system flow.
如何利用模式匹配理论，根据串的最大匹配算法思想实现系统流程中最长地址数据优先拆分。
How to use the patter matching theory based on bunch most matching arithmetic to achieve furthest address data first to split in the system flow.
应用推荐