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.9 required=5.0 tests=BAYES_00 autolearn=ham
	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!news3.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!nx01.iad01.newshosting.com!newshosting.com!newsfeed.icl.net!newsfeed.fjserv.net!news.tele.dk!news.tele.dk!small.news.tele.dk!lnewsinpeer00.lnd.ops.eu.uu.net!bnewsinpeer00.bru.ops.eu.uu.net!emea.uu.net!newsfeed.arcor.de!newsspool2.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Newsgroups: comp.lang.ada
Subject: Re: ada is getting spanked :(
From: Georg Bauhaus <bauhaus@futureapps.de>
In-Reply-To: <1itn8qttbs3xw$.17udephvl95ro.dlg@40tude.net>
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>
Content-Type: text/plain
Content-Transfer-Encoding: 7bit
Organization: #
Message-ID: <1162300360.13329.6.camel@localhost>
Mime-Version: 1.0
X-Mailer: Evolution 2.6.1 
Date: Tue, 31 Oct 2006 14:12:41 +0100
NNTP-Posting-Date: 31 Oct 2006 14:04:40 CET
NNTP-Posting-Host: accd7c2b.newsspool4.arcor-online.net
X-Trace: 
 DXC=Oh?:[OlRSh4T2Rfi6<W9f54IUK<Cl32<14Fo<]lROoR14nDHegD_]R5b?QQ5IGn]I?TiQOITnENo2FU`4:K;4eR7:>T\IlWT;8>DL?6o63mc_2
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.ada:7289
Date: 2006-10-31T14:04:40+01:00
List-Id: <comp.lang.ada>

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.