home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!gatech!concert!borg!news_server!martinc
- From: martinc@grover.cs.unc.edu (Charles R. Martin)
- Newsgroups: comp.lang.rexx
- Subject: Re: Regular expression syntax
- Message-ID: <MARTINC.92Sep8200040@grover.cs.unc.edu>
- Date: 9 Sep 92 00:00:40 GMT
- References: <19920908084344SEB1525@MVS.draper.com> <2414.imc@uk.ac.ox.prg>
- Sender: news@cs.unc.edu
- Organization: UNC Department of Computer Science
- Lines: 23
- In-reply-to: imc@comlab.ox.ac.uk's message of 8 Sep 92 16:12:49 GMT
-
- After a fair bit of thought about it, I'm becoming more and more
- convinced -- brace yourselves -- that the better solution is to make a
- regular expression syntax the PRIMITIVE notion in rexx, and make all the
- current semantics abbreviations for some r.e.
-
- After all, we're guaranteed that anything we want to do with rexx is
- going to be finite-state; we can't lose any semantic power by doing so.
- But we make available lots of potential power that doesn't appear to be
- there now. A regular expression compiler and interpreter is a
- straightforward exercise, and would probably be simpler than handling a
- lot of special cases. And by having the power of a full FSA available,
- we can avoid worrying about what whitespace etc is, because anyone can
- get exactly the desired semantics by explicitly coding the approriate
- r.e., while not changing the overlaid "old rexx" language in any way.
- --
- Charles R. Martin/(Charlie)/martinc@cs.unc.edu/(ne crm@cs.duke.edu)
- O/Dept. of Computer Science/CB #3175 UNC-CH/Chapel Hill, NC 27599-3175
- H/3611 University Dr #13M/Durham, NC 27707/(919) 419 1754
- ----------------------------------------------------------------------
- "I am he who walks the States with a barb'd tongue, questioning every
- one I meet,/Who are you that wanted only to be told what you knew
- before?/ Who are you that wanted only a book to join you in your
- nonsense?" _Leaves of Grass_ xxiii.4.
-