On Wed, 14 Aug 2024 01:55:22 -0500 Willy Jensen <[email protected]>
wrote:

:>I cannot comment on the PASN<>HASN issue, but I have written an assembler 
subroutine which is faster than ASAXWC. I also have a REXX subroutine which I 
use in public domain REXXs where I cannot rely on the user being able or 
allowed to install an assembler module.

I have been thinking about patterns and it looks like it may take several
passes.

For example, pattern   *CD*Q

To match     ABCDGQCDQ

Would take multiple passes 

Scan for CD, match, scan for Q, match, fail since trailing characters

So would need to start again looking for another CD, etc. Or perhaps first
scan for another Q? Etc.

Logic would seem to chop off the start/end if not masked, and keep looping
until either match or no possibility.

--
Binyamin Dissen <[email protected]>
http://www.dissensoftware.com

Director, Dissen Software, Bar & Grill - Israel

----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN

Reply via email to