Description: Pattern matching string from the pattern p, p [k] started with the body of t, t [j+ i] began to turn more, (if p [k] == t [j+ i] continues to compare p [k+1] =? = t [j+ i+1] until the emergence of p [k+ l]! = t [j+ i+ l-1], to re-search for new p [k+ l] in that the largest k ' and then Comparison of p [k' ]=?= t [j+ i+ l] until the end of the match or traversal). Eliminating the need for the previous k comparisons. When the corresponding p [i] k-there are several, take the largest k.
To Search:
File list (Check if you may need any files):
串的模式匹配.doc
Download