Efficient string matching: an aid to bibliographic search
Communications of the ACM
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Syntax of Programming Languages: Theory and Practice
Syntax of Programming Languages: Theory and Practice
Software Tools
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Using an APL macroprocessor to implement generalized software systems
APL '79 Proceedings of the international conference on APL: part 1
The SNOBOL 4 programming language
The SNOBOL 4 programming language
LOGOS: An APL programming environment
APL '86 Proceedings of the international conference on APL
System development methodology using LOGOS
APL '87 Proceedings of the international conference on APL: APL in transition
Extending APL for pattern matching
APL '83 Proceedings of the international conference on APL
| Hi-index | 0.00 |
Regular expressions are a powerful notation for expressing text patterns. This paper discusses classical regular expressions and their extension into the domain of APL. These extensions are manifest in terms of locator templates, which describe patterns to be searched for, and action templates, which specify an action to be performed when a match is encountered. An algorithm for implementing these concepts is briefly discussed. The algorithm compiles a template into code which is then interpreted in the context of a specific text vector to be searched. Numerous examples are espoused to demonstrate the utility of pattern matching over a wide range of problems.