A string pattern matching extension to pascal and some comparisons with snobol4 | Zendy

Liu KenChih | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A string pattern matching extension to pascal and some comparisons with snobol4

Author(s) -

Liu KenChih

Publication year - 1986

Publication title -

software: practice and experience

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.437

H-Index - 70

eISSN - 1097-024X

pISSN - 0038-0644

DOI - 10.1002/spe.4380160605

Subject(s) - suffix , concatenation (mathematics) , pascal (unit) , computer science , prefix , pattern matching , string searching algorithm , alternation (linguistics) , extension (predicate logic) , theoretical computer science , arithmetic , mathematics , programming language , linguistics , philosophy

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.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research