| 摘要 |
A pattern matching system comprises a state transition table having multiple rows respectively identified by address values. Each row contains a reference character, first and second hash functions and first and second address values. A hash calculator determines a hash value by substituting a target character into a previously specified hash function. The hash value is summed with a previously specified address value to produce a new address value of the table. The target character is compared with the reference character of the identified row. According to a result of the comparison, one of the hash functions and one of the address values of the identified row are specified. The currently specified hash function is used in the hash calculator instead of the previously specified hash function to determine the next hash value, with which the currently specified address value is summed to produce a new access value for the next search.
|
