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,b4b864fa2b61bbba X-Google-Attributes: gid103376,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news3.google.com!feeder3.cambrium.nl!feeder5.cambrium.nl!feeder1.cambrium.nl!feed.tweaknews.nl!newsfeed-0.progon.net!progon.net!uucp.gnuu.de!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail Newsgroups: comp.lang.ada Subject: Re: Parallel Text Corpus Processing with Ada? From: Georg Bauhaus In-Reply-To: References: <1194735959.240323.38210@v2g2000hsf.googlegroups.com> <1t1ab1hzsng9p.101gcl2uomeoy.dlg@40tude.net> <1194796479.6547.13.camel@K72> Content-Type: text/plain Content-Transfer-Encoding: 7bit Message-Id: <1194880073.1007.152.camel@kartoffel> Mime-Version: 1.0 X-Mailer: Evolution 2.10.1 Date: Mon, 12 Nov 2007 16:07:53 +0100 Organization: Arcor NNTP-Posting-Date: 12 Nov 2007 16:06:44 CET NNTP-Posting-Host: a32ca3f6.newsspool1.arcor-online.net X-Trace: DXC=fCARUcU]^L0^cW`WBF>WQ4Fo<]lROoR1Fl8W>\BH3Y2bo8E7FcCc:>N[W 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... > As a general note, pattern > matching languages are declarative with all disadvantage of. OK, but being declarative isn't true of SNOBOL4's, because you can modify patterns during scanning, if you are crazy enough to do this. ;-)