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-7-bit
Path: 
 g2news2.google.com!news2.google.com!news.germany.com!newsfeed.utanet.at!newsfeed01.chello.at!newsfeed.arcor.de!newsspool4.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="us-ascii"
Content-Transfer-Encoding: 7bit
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>
 <1itn8qttbs3xw$.17udephvl95ro.dlg@40tude.net>
 <1162300360.13329.6.camel@localhost>
Date: Tue, 31 Oct 2006 15:14:09 +0100
Message-ID: <1kxtllqfmnhc7$.180p2vsderp9v.dlg@40tude.net>
NNTP-Posting-Date: 31 Oct 2006 15:14:09 CET
NNTP-Posting-Host: 3939a78a.newsspool2.arcor-online.net
X-Trace: 
 DXC=9^H9biGjWIN[kmHKHnaEnMA9EHlD;3YcB4Fo<]lROoRAFl8W>\BH3YB6ZJFkn4AeoADNcfSJ;bb[EFCTGGVUmh?DN\HXHJ4e80NjSVZhU4;QRC
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.ada:7292
Date: 2006-10-31T15:14:09+01:00
List-Id: <comp.lang.ada>

On Tue, 31 Oct 2006 14:12:41 +0100, Georg Bauhaus wrote:

> On Tue, 2006-10-31 at 12:32 +0100, Dmitry A. Kazakov wrote:
> 
>> 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.
> 
> Why? Boyer-Moore and similar algorithms may well be part
> of any string scanning machine, no matter what languages
> it can recognize. By the AS-IF rule, as long as RE semantics
> are followed, I don't see a reason why optimized RE
> scanning should be faster than optimized CF scanning.

Yes, if you (the compiler) *can* understand semantics.

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