On the Use of Regular Expressions for Searching Text

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 3, 1997, Pages 413-426

  Clarke, Charles L A ^a   Cormack, Gordon V ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Algorithms; D.3.2 Programming Languages : Language Classifications specialized application languages; Regular expressions; Regular languages; SGML

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SYSTEMS PROGRAMMING; KNOWLEDGE BASED SYSTEMS;

REGULAR EXPRESSIONS; SIMILAR MARKUP LANGUAGE (SGML); SOURCE CODE ANALYSIS; TEXT SEARCH APPLICATIONS;

FORMAL LANGUAGES;

EID: 0031140972     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/256167.256174     Document Type: Article

References (39)

1. ABRAHMSON, K. 1987. Generalized string matching. SIAM J. Comput. 16, 1039-1051.
2. AHO, A. V. 1980. Pattern matching in strings. In Formal Language Theory - Perspectives and Open Problems, R. V. Book, Ed. Academic Press, New York, 325-344.
3. AHO, A. V. 1990. Algorithms for finding patterns in strings. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. MIT Press, Cambridge, Mass., 256-300.
4. AHO, A. V. AND CORASICK, M. J. 1975. Efficient string matching - An aid to bibliographic search. Commun. ACM 18, 6 (June), 333-340.
5. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
6. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compiler - Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass.
7. BAEZA-YATES, R. A. 1989. Efficient text searching. Ph.D. thesis, Uni. of Waterloo, Waterloo, Canada.
8. BAEZA-YATES, R. A. AND GONNET, G. H. 1992. A new approach to text searching. Commun. ACM 35, 10 (Oct.), 74-82.
9. BERRY, G. AND SETHI, R. 1986. From regular expressions to deterministic automata. Theor. Comput. Sci. 48, 117-126.
10. BOYER, R. S. AND MOORE, J. S. 1977. A fast string searching algorithm. Commun. ACM 20, 10 (Oct.), 762-772.
11. BRYAN, M. 1988. SGML - An Author's Guide to the Standard Generalized Markup Language. Addison-Wesley, Reading, Mass.
12. BRZOZOWSKI, J. A. 1964. Derivatives of regular expressions. J. ACM 11, 4, 481-494.
13. CHANG, C.-H. AND PAIGE, R. 1992. From regular expressions to DFA's using compressed NFA's. In Proceedings of the 3rd Annual Symposium on Combinatorial Matching. Lecture Notes in Computer Science, vol. 644. Springer-Verlag, Berlin, 90-109.
14. CLARKE, C. L. A. AND CORMACK, G. V. 1996. Context grep. Tech. Rep. CS-96-41, Computer Science Dept., Univ. of Waterloo, Waterloo, Canada.
15. CLARKE, C. L. A., CORMACK, G. V., AND BURKOWSKI, F. J. 1995a. An algebra for structured text search and a framework for its implementation. Comput. J. 38, 1, 43-56.
16. CLARKE, C. L. A., CORMACK, G. V., AND BURKOWSKI, F. J. 1995b. Schema-independent retrieval from hetrogeneous structured text. In Proceedings of the 4th Annual Symposium on Document Analysis and Information Retrieval. UNLV, Las Vegas, Nev.
17. FISHER, M. AND PATTERSON, M. 1974. String matching and other product. In Proceedings of the SIAM-AMS Conference on Complexity of Computation, R. M. Karp, Ed. America Mathematical Society, Providence, R.I., 113-125.
18. HARGREAVES, K. A. AND BERRY, K. 1992. Regex. Free Software Foundation, Cambridge, Mass. Available from ftp://prep.ai.mit.edu/pub/gnu.
19. HARMAN, D. 1993. Overview of the first TREC conference. In Proceeding of the 16th Annual International ACM SIGIR Conference. ACM Press, New York, 36-47.
20. HOPCROFT, J. E. AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass.
21. HORSPOOL, R. N. 1980. Practical fast searching in strings. Softw. Pract. Exper. 10, 501-506.
22. IEEE. 1992. Standard for information technology - Portable Operating System Interface (POSIX) - Part 2 (Shell and utilities) - Section 2.8 (Regular expression notation). IEEE Std 1003.2, Institute of Electrical and Electronics Engineers, New York.
23. ISO. 1986. Information processing - Text and office systems - Standard Generalized Markup Language (SGML). ISO 8879, International Standards Organization, Geneva, Switzerland.
24. JAAKKOLA, J. AND KILPELÄINEN, P. 1995. Sgrep home page. Dept. of Computer Science, Univ. of Helsinki, Helsinki, Finland. Available as http://www.cs.helsinki.fi/ jjaakkol/sgrep.html.
25. JOHNSON, W. L., PORTER, J. H., ACKLEY, S. I., AND ROSS, D. T. 1968. Automatic generation of efficient lexical processors using finite state techniques. Commun. ACM 11, 12 (Dec.), 805-813.
26. KNIGHT, J. R. AND MYERS, E. W. 1995. Super-pattern matching. Algorithmica 13, 211-243.
27. KNUTH, D. E., MORRIS, J. H., AND PRATT, V. R. 1977. Fast pattern matching in strings. SIAM J. Comput. 6, 2 (June), 323-350.
28. LESK, M. E. 1975. Lex - A lexical analyzer generator. Computing Science Tech. Rep. 39, AT&T Bell Laboratories, Murray Hill, N.J.
29. MANBER, U. AND BAEZA-YATES, R. 1991. An algorithm for string matching with a sequence of don't cares. Inf. Process. Lett. 37, 133-136.
30. MCNAUTHTON, R. AND YAMADA, H. 1960. Regular expressions and state graphs for automata. IRE Trans. Electronic Comput. EC-9, 1 (Mar.), 39-47.
31. MURPHY, G. C. AND NOTKIN, D. 1995. Lightweight source model extraction. In Proceedings of the 3rd ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE '95). ACM Press, New York.
32. MYERS, E. W. AND MILLER, W. 1989. Approximate matching of regular expressions. Bull. Math. Biol. 51, 1, 5-37.
33. OUSTERHOUT, J. K. 1994. Tcl and the Tk Toolkit. Addison-Wesley, Reading, Mass.
34. PIKE, R. 1987a. Structural regular expressions. In Proceedings of the European UNIX User's Group Conference. EUUG, Helsinki, Finland.
35. PIKE, R. 1987b. The text editor sam. Softw. Pract. Exper. 17, 11 (Nov.), 813-845.
36. THOMPSON, K. 1968. Regular expression search algorithm. Commun. ACM 11, 6 (June), 419-422.
37. WALL, L. AND SCHWARTZ, R. L. 1991. Programming Perl. O'Reilly and Associates, Sebastopol, Calif.
38. WU, S. AND MANBER, U. 1992a. agrep - A fast approximate pattern matching algorithm. In Proceedings of the USENIX Winter 1992 Technical Conference. USENIX Assoc., Berkeley, Calif, 153-162.
39. WU, S. AND MANBER, U. 1992b. Fast text searching allowing errors. Commun. ACM 35, 10 (Oct.), 83-91.