On Sunday 29 August 2004 HH:58:18, Jenda Krynicky wrote:
> From: Philipp Traeder <[EMAIL PROTECTED]>
>
> > You're right - the problem I'm trying to solve is quite restricted -
> > and I'm very thankful for this ;-) Basically, I'm trying to write an
> > application that "recognizes" log file formats
From: Philipp Traeder <[EMAIL PROTECTED]>
> I'm facing a roughly similar problem at the moment, and I was planning
> on using String::Compare or something like it for comparing strings
> char by char. Taking a first glance at the code, it doesn't look too
> hard to modify it in a way that it return
From: Philipp Traeder <[EMAIL PROTECTED]>
> You're right - the problem I'm trying to solve is quite restricted -
> and I'm very thankful for this ;-) Basically, I'm trying to write an
> application that "recognizes" log file formats, so that the following
> lines are identified as several manifesta
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Sat, 28 Aug 2004 01:21, Chris Devers wrote:
> Rather than trying to find a tool for this, you'll be much better off
> trying to come up with an understanding of what within the patterns that
NP-Hard problems are still quite possible to solve. I work
On Saturday 28 August 2004 HH:27:20, Chris Devers wrote:
> On Sat, 28 Aug 2004, Philipp Traeder wrote:
> > I'm not sure if I understood the Halting Problem completely, but could
> > you give a hint what brings you to the assumption that "automatically
> > generating regular expressions from a bunch
On Sat, 28 Aug 2004, Philipp Traeder wrote:
I'm not sure if I understood the Halting Problem completely, but could
you give a hint what brings you to the assumption that "automatically
generating regular expressions from a bunch of text" is a variant of
the Halting Problem?
I'm not a computer sc
On Friday 27 August 2004 HH:21:13, Chris Devers wrote:
> On Fri, 27 Aug 2004, Mark Maunder wrote:
> > I've google'd and CPAN'd and no luck. Is there a tool out there that
> > will generate a regular expression based on a series of string inputs
> > that are similar but have parts that differ[?]
>
[
On Sat, 28 Aug 2004, Mark Maunder wrote:
I suspect you're right. For the archives, on my attempt to solve this I
came across the following useful modules:
...so why didn't you look before asking ?
Anyway, you said you want a tool to take a set of strings, some that you
want to match, some that you
Hi Chris,
I suspect you're right. For the archives, on my attempt to solve this I
came across the following useful modules:
Regexp::List - builds regular expressions out of a list of words
Regexp::Parser - base class for parsing regexes
String::REPartition - Generates a regex to partition a data
On Fri, 27 Aug 2004, Mark Maunder wrote:
I've google'd and CPAN'd and no luck. Is there a tool out there that
will generate a regular expression based on a series of string inputs
that are similar but have parts that differ[?]
I suspect that this is a Hard problem, as in NP-Hard/NP-Incomplete, as
Hi,
I've google'd and CPAN'd and no luck. Is there a tool out there that
will generate a regular expression based on a series of string inputs
that are similar but have parts that differ. Ideally I'd like to be able
to create an regex generator object into which I can feed strings. Then
call a met
11 matches
Mail list logo
