From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,dd4586b9dd51c602
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: general-purpose vs. domain-specific programming languages
Date: 1998/01/16
Message-ID: <dewar.884997299@merv>#1/1
X-Deja-AN: 316699334
References: <98011217550672@psavax.pwfl.com> <dewar.884697457@merv>
 <Pine.BSF.3.96.980113091804.8940B-100000@shell5.ba.best.com>
 <34BE4F53.4B56@gsfc.nasa.gov> <8clnwgnv2z.fsf@gadget.cscaper.com>
X-Complaints-To: usenet@news.nyu.edu
X-Trace: news.nyu.edu 884997605 22744 (None) 128.122.140.58
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1998-01-16T00:00:00+00:00
List-Id: <comp.lang.ada>


Randal says

<<Really, regex are not that hard.  If you can remember the 425 keywords
of Ada, you can certainly remember the 10 operations of a regex. :-)
>>

Well of course *nearly* all the readership of this group knows how
silly that statement is, but just for the benefit of those listening in,
we sure hope that Randal is better at making regex's than counting
reserved words in Ada (there are less than 70). I assume that keywords
does mean reserved words, there is no such thing per se as a keyword in Ada
terminology.

P.S. For my taste the pattern matching semantics of SNOBOL4 (and hence
of the pattern matching routines provided with GNAT) is far more flexible,
far more powerful, and far easier to use than regexp's.