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,b4b864fa2b61bbba
X-Google-Attributes: gid103376,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news3.google.com!feeder1-2.proxad.net!proxad.net!feeder2-2.proxad.net!newsfeed.arcor.de!newsspool3.arcor-online.net!news.arcor.de.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: Parallel Text Corpus Processing with Ada?
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: <1194735959.240323.38210@v2g2000hsf.googlegroups.com>
 <1t1ab1hzsng9p.101gcl2uomeoy.dlg@40tude.net> <1194796479.6547.13.camel@K72>
 <qde6vz562brd.yx5hzl15of6t.dlg@40tude.net>
 <1194880073.1007.152.camel@kartoffel>
Date: Mon, 12 Nov 2007 17:11:47 +0100
Message-ID: <1wt6yiio3wzvb.1c5nyydy8qk09.dlg@40tude.net>
NNTP-Posting-Date: 12 Nov 2007 17:04:49 CET
NNTP-Posting-Host: ab7daf58.newsspool1.arcor-online.net
X-Trace: 
 DXC=a5f;JhhO:EC6PJ?[X6JIXEic==]BZ:afN4Fo<]lROoRAFl8W>\BH3YB\JjV>48gjRODNcfSJ;bb[EFCTGGVUmh?DLK[5LiR>kgBBUenTGLUYoN
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news1.google.com comp.lang.ada:18316
Date: 2007-11-12T17:04:49+01:00
List-Id: <comp.lang.ada>

On Mon, 12 Nov 2007 16:07:53 +0100, Georg Bauhaus wrote:

> On Mon, 2007-11-12 at 14:31 +0100, Dmitry A. Kazakov wrote:
> 
>> There is wide class of problems which patterns do not solve or solve
>> inefficiently. Like building dictionaries finding longest common substring
>> etc. (Compiling Ada programs is also in this class. (:-))
> 
> OK. This valuable context information would, I think, be a nice
> addition to your SNOBOL patterns comments.
> In line with the SNOBOL4 motto: Don't use pattern matching...

I am just trying to be honest. (:-))

Then existence of unsolvable problems does not imply that any problem is
like that. There is a class of problems where patterns are suitable. They
best fit in scripting environments.

But when I see patterns in the context of parallel processing of massive
amounts of data, then the first thing I would do is to verify if I really
should use them.

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