Implementing SNOBOL4 pattern matching in Icon

Authors:
Ralph E. Griswold
Affiliations:
The University of Arizona, Department of Computer Science, Tucson, AZ 85721, U.S.A.
Venue:
Computer Languages
Year:
1983

Citing 10
Cited 0

Result sequences

Computer Languages
Generators in Icon

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Evaluation of Expressions in Icon

ACM Transactions on Programming Languages and Systems (TOPLAS)
The SL5 procedure mechanism

Communications of the ACM
An Algol-based implementation of SNOBOL4 patterns

Communications of the ACM
A theory of discrete patterns and their implementation in SNOBOL4

Communications of the ACM
Mathematical semantics of SNOBOL4

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
String analysis and synthesis in SL5

ACM '76 Proceedings of the 1976 annual conference
A procedural approach to pattern matching in SNOBOL4

ACM '74 Proceedings of the 1974 annual conference - Volume 1
The SNOBOL 4 programming language

The SNOBOL 4 programming language

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents several models for string pattern matching. Two of these provide a basis for implementing pattern matching in SNOBOL4. The cursor model does this in terms of changes in the position in the subject as patterns are applied. The substring model, on the other hand, is concerned with the portion of the subject that is matched by patterns. More general models are introduced, leading to a variety of extensions and generalizations of pattern matching. An implementation of these models is given in Icon.