Programming Techniques: Regular expression search algorithm

Abstract

A method for locating specific character strings embedded in character text is described and an implementation of this method in the form of a compiler is discussed. The compiler accepts a regular expression as source language and produces an IBM 7094 program as object language. The object program then accepts the text to be searched as input and produces a signal every time an embedded string in the text matches the given regular expression. Examples, problems, and solutions are also presented.

References

1. 1 BRZOZOWSKI, J. A. Derivatives of regular expressions. J. ACM 11, 4 (Oct. 1964), 481-494.
2. 2 KLEENE, S. C. Representation of events in nerve nets and finite automata. In Automata Studies, Ann. Math. Stud. No. 34. Princeton U. Press, Princeton, N.J., 1956, pp. 3-41.
3. 3 IBM Corp. IBM 7094 principles of operation. File No. 7094-01, Form A22-6703-1.
4. 4 KUNO, S., AND OETTINGER, A. G. Multiple-path syntactic analyzer. Proc. IFIP Congress, Munich, 1962, North-Holland Pub. Co., Amsterdam.