From: Georg Bauhaus <rm.tsoh+bauhaus@maps.futureapps.de>
Subject: Re: Parallel Text Corpus Processing with Ada?
Date: Mon, 12 Nov 2007 16:07:53 +0100
Date: 2007-11-12T16:06:44+01:00 [thread overview]
Message-ID: <1194880073.1007.152.camel@kartoffel> (raw)
In-Reply-To: <qde6vz562brd.yx5hzl15of6t.dlg@40tude.net>
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. ;-)
next prev parent reply other threads:[~2007-11-12 15:07 UTC|newest]
Thread overview: 17+ messages / expand[flat|nested] mbox.gz Atom feed top
2007-11-10 23:05 Parallel Text Corpus Processing with Ada? braver
2007-11-11 0:11 ` tmoran
2007-11-11 1:10 ` Georg Bauhaus
2007-11-11 8:23 ` Dmitry A. Kazakov
2007-11-11 15:54 ` Georg Bauhaus
2007-11-11 16:13 ` Georg Bauhaus
2007-11-12 13:31 ` Dmitry A. Kazakov
2007-11-12 15:07 ` Georg Bauhaus [this message]
2007-11-12 16:11 ` Dmitry A. Kazakov
2007-11-11 22:49 ` braver
2007-11-12 16:17 ` Dmitry A. Kazakov
2007-11-13 22:45 ` Simon Wright
2007-11-14 23:38 ` braver
2007-11-15 9:39 ` Ludovic Brenta
2007-11-15 11:12 ` Dmitry A. Kazakov
2007-11-15 21:11 ` Simon Wright
2007-11-17 1:05 ` Randy Brukardt
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox