Issue No. 08 - August (1989 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.31357
<p>A technique for implementing a static transition table of a string pattern matching machine which locates all occurrences of a finite number of keywords in a string is described. The approach is based on S.C. Johnson's (1975) storage and retrieval method of the transition table of a finite-state machine. By restricting the transition table of the finite-state machine to that of the string pattern-matching machine, triple arrays of Johnsons's data structure can be reduced to two arrays. The retrieval program of the reduced data structure can be speeded up by a finite straight program without loops.</p>
implementation technique; keyword location; static string pattern matching machines; transition table; finite-state machine; triple arrays; Johnsons's data structure; retrieval program; reduced data structure; finite straight program; data structures; information retrieval; subroutines
J. Aoe, "An Efficient Implementation of Static String Pattern Matching Machines," in IEEE Transactions on Software Engineering, vol. 15, no. , pp. 1010-1016, 1989.