ACM Home Page
Please provide us with feedback. Feedback
Programming Techniques: Regular expression search algorithm
Full text PdfPdf (533 KB)
Source
Communications of the ACM archive
Volume 11 ,  Issue 6  (June 1968) table of contents
Pages: 419 - 422  
Year of Publication: 1968
ISSN:0001-0782
Author
Ken Thompson  Bell Telphone Labs, Inc., Murray Hill
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 65,   Downloads (12 Months): 506,   Citation Count: 52
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/363347.363387
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
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
IBM Corp. IBM 7094 principles of operation. File No. 7094-01, Form A22-6703-1.
 
4
KUNO, S., AND OETTINGER, A. G. Multiple-path syntactic analyzer. Proc. IFIP Congress, Munich, 1962, North-Holland Pub. Co., Amsterdam.

CITED BY  52