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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.