A string pattern matching extension to pascal and some comparisons with snobol4
- 1 June 1986
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 16 (6) , 541-548
- https://doi.org/10.1002/spe.4380160605
Abstract
This paper presents an extension of Pascal with string pattern matching. Pattern definitions are built using six basic operations: alternation, concatenation, immediate value assignment, intersection, difference and complement. The last three have not been previously implemented and they increase the expressive power beyond context‐free languages. The pattern matching actions are augmented with three options: trace, prefix and suffix. Comparisons with a SNOBOL4 implementation are also presented. This experiment demonstrates that Pascal with pattern matching is a useful tool for string processing applications.Keywords
This publication has 7 references indexed in Scilit:
- RebusACM SIGPLAN Notices, 1985
- A string extension for PascalACM SIGPLAN Notices, 1983
- On String Pattern Matching: A New Model with a Polynomial Time AlgorithmSIAM Journal on Computing, 1981
- Implementing strings in Pascal—againSoftware: Practice and Experience, 1979
- Implementing strings in PascalSoftware: Practice and Experience, 1979
- Strings and the sequence abstraction in PascalSoftware: Practice and Experience, 1979
- Macro SPITBOL—a SNOBOL4 compilerSoftware: Practice and Experience, 1977