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=-0.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,278bf0771374076e
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII
Path: 
 g2news2.google.com!news3.google.com!news4.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!newsfeed00.sul.t-online.de!newsfeed01.sul.t-online.de!t-online.de!newsfeed.hanau.net!noris.net!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: ada is getting spanked :(
Newsgroups: comp.lang.ada
User-Agent: 40tude_Dialog/2.0.15.1
MIME-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
Content-Transfer-Encoding: 8bit
Reply-To: mailbox@dmitry-kazakov.de
Organization: cbb software GmbH
References: <1162052997.664967.135910@e3g2000cwe.googlegroups.com>
	 <3321666.DLNnW6yRHq@linux1.krischik.com>
	 <1162085683.30292.23.camel@localhost.localdomain>
	 <uD41h.21161$E02.8422@newsb.telia.net>
 <1162153407.18869.34.camel@localhost.localdomain>
 <47b1h.21208$E02.8795@newsb.telia.net>
Date: Tue, 31 Oct 2006 12:32:19 +0100
Message-ID: <1itn8qttbs3xw$.17udephvl95ro.dlg@40tude.net>
NNTP-Posting-Date: 31 Oct 2006 12:32:19 CET
NNTP-Posting-Host: cf198365.newsspool1.arcor-online.net
X-Trace: 
 DXC=LFE_?>XMbXeEB;5>eE0T7mic==]BZ:afn4Fo<]lROoRa^YC2XCjHcbiCFFJ[iAPm?nDNcfSJ;bb[eFCTGGVUmh?dN\HXHJ4e80n3aJHlfF8M2m
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.ada:7287
Date: 2006-10-31T12:32:19+01:00
List-Id: <comp.lang.ada>

On Sun, 29 Oct 2006 23:50:24 GMT, Bj�rn Persson wrote:

> Georg Bauhaus wrote:

>> How could a notion of REs be both precise and precisely
>> applicable to the ways in which various PLs implement them?
>>  E.g. how can you turn off Boyer-Moore string searching when
>> one implementation has it, just so that only some specified
>> internal way of pattern matching is compared?
> 
> I wasn't talking of internal implementations. As I understand it, 
> "regex" is a name of a family of similar notations for expressing 
> patterns. If you don't write "[ABC]*" for "any number of A's, B's and 
> C's in any order", then it isn't regex.

Actually RE is not a notation, it is a formal language. SNOBOL patterns
represent a different wider class of languages. For example SNOBOL can
matching balanced strings like (a(b))(c). Technically, a highly optimized
implementation of RE should beat SNOBOL.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de