Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Efficient string matching: an aid to bibliographic search
Communications of the ACM
| Hi-index | 0.00 |
This paper describes a method of implementing a static transition table of a string pattern matching machine to locate all occurrences of a finite number of keywords in a text string. The scheme combines the fast access of an array representation with the compactness of a list structure. Each transition can be computed from the present data structure in O(1) time and the storage is as small as the list structure. The construction and pattern matching programs associated with the present data structure are provided and the efficiency is evaluated by a empirical results.