On Thu, 2010-11-25 at 11:20 -0500, Shmuel Metz (Seymour J.) wrote: > In <[email protected]>, on 11/24/2010 > at 04:26 PM, Dave Salt <[email protected]> said: > > >some of the constructs of regular expressions. > > Better than nothing, but I still want full bore pattern matching, > e.g., > > F R'(?!REG/b)[[:alpha]]{3}\d*' > > to find a string containing three letters and a string of digits, > where the three letters are not 'REG'. This, opf course, is only a > simple example; any SuperWylbur® user could give you more complicated, > but useful, searches. Also, what about named captures? >
Yes. I would like the Perl variant, but I would be satisfied with POSIX compliant regexs. I think that the POSIX is more likely because the IBM C compiler implements them. So the ISPF people would not need to write them from scratch. Yes, I guess it would be possible to write one myself in REXX (no C compiler here), but I really want it integrated with the FIND, CHANGE, RFIND, and RCHANGE commands. -- John McKown Maranatha! <>< ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: GET IBM-MAIN INFO Search the archives at http://bama.ua.edu/archives/ibm-main.html
