From: braver <deliverable@gmail.com>
Subject: Re: Wide Finder in Ada?
Date: Mon, 12 Nov 2007 01:55:07 -0800
Date: 2007-11-12T01:55:07-08:00 [thread overview]
Message-ID: <1194861307.660307.244010@v65g2000hsc.googlegroups.com> (raw)
In-Reply-To: <47380779$1@news.post.ch>
On Nov 12, 10:57 am, Martin Krischik <krisc...@users.sourceforge.net>
wrote:
> First things First: Any Splitbool specialist which can turn the Ruby
> regex into splitbool?
The best solutions there went from regexes to custom parsers/field
extractors. I wonder whether your excellent SAR is applicable, or
Dmitry Kazakov's SNOBOL matching? Here's what top Python things look
like:
http://effbot.org/zone/wide-finder.htm
They use a Python toolkit replacing regexen, which is faster:
http://www.egenix.com/products/python/mxBase/mxTextTools/
Apparently regexen are not needed and something custom/simpler will
do, like splitting lines in Ada -- what's the fastest way to do that?
Cheers,
Alexy
next prev parent reply other threads:[~2007-11-12 9:55 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2007-11-12 1:37 Wide Finder in Ada? braver
2007-11-12 7:57 ` Martin Krischik
2007-11-12 9:55 ` braver [this message]
2007-11-12 19:11 ` Martin Krischik
2007-11-12 10:54 ` Georg Bauhaus
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox