alex goldman <[EMAIL PROTECTED]> writes:
> Lawrence Kirby wrote:
[snip]
>> My response talks about relevance, not ambiguity.
>
> Well, your response was irrelevant.
This entire discussion is irrelevant to most, if not all, of the
newsgroups to which it's being posted. comp.lang.c, where I'm readi
Lawrence Kirby wrote:
> On Tue, 10 May 2005 06:52:18 -0700, alex goldman wrote:
>
>> Lawrence Kirby wrote:
>
> ...
>
>>> However the original quote was in the context of regular expressions, so
>>> discussion of the terminology used in regular expressions is far more
>>> relevant than the termi
On Tue, 10 May 2005 06:52:18 -0700, alex goldman wrote:
> Lawrence Kirby wrote:
...
>> However the original quote was in the context of regular expressions, so
>> discussion of the terminology used in regular expressions is far more
>> relevant than the terminology used in graph search and optim
Lawrence Kirby wrote:
> On Tue, 10 May 2005 04:58:48 -0700, alex goldman wrote:
>
>> Sean Burke wrote:
>
> ...
>
>>> No, you're just confused about the optimization metric.
>>> In regexes, "greedy" match optimizes for the longest match,
>>> not the fastest.
>>>
>>> And this is common regex ter
On Tue, 10 May 2005 04:58:48 -0700, alex goldman wrote:
> Sean Burke wrote:
...
>> No, you're just confused about the optimization metric.
>> In regexes, "greedy" match optimizes for the longest match,
>> not the fastest.
>>
>> And this is common regex terminology - man perlre and you will
>> f
Sean Burke wrote:
>
> alex goldman <[EMAIL PROTECTED]> writes:
>
>> vermicule wrote:
>>
>> >
>> > What is so hard to understand ?
>> > Should be perfectly clear even to a first year undergraduate.
>> >
>> > As for "greedy" even a minimal exposure to Djikstra's shortest path
>> > algorithm wou
alex goldman <[EMAIL PROTECTED]> writes:
> vermicule wrote:
>
> >
> > What is so hard to understand ?
> > Should be perfectly clear even to a first year undergraduate.
> >
> > As for "greedy" even a minimal exposure to Djikstra's shortest path
> > algorithm would have made the concept intuitiv
http://www.developer.com/lang/article.php/10924_3330231_3
On Sunday 08 May 2005 11:53 am, alex goldman wrote:
> He's right actually. If we understand the term "greedy" as it's used in
> graph search and optimization algorithms, Python's RE matching actually IS
> greedy.
--
James Stroud
UCLA-DOE
alex goldman <[EMAIL PROTECTED]> writes:
> vermicule wrote:
>
>>
>> What is so hard to understand ?
>> Should be perfectly clear even to a first year undergraduate.
>>
>> As for "greedy" even a minimal exposure to Djikstra's shortest path
>> algorithm would have made the concept intuitive. And f
vermicule wrote:
>
> What is so hard to understand ?
> Should be perfectly clear even to a first year undergraduate.
>
> As for "greedy" even a minimal exposure to Djikstra's shortest path
> algorithm would have made the concept intuitive. And from memory,
> that is the sort of thing done in Com
vermicule <[EMAIL PROTECTED]> writes:
> "Xah Lee" <[EMAIL PROTECTED]> writes:
[...]
>
> It seems to me that you want the Python doc to be written for morons.
Not for morons, but for trolls. Don't feed them.
--
Måns Rullgård
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python
"Xah Lee" <[EMAIL PROTECTED]> writes:
> A|B, where A and B can be arbitrary REs, creates a regular expression
> that will match either A or B. An arbitrary number of REs can be
> separated by the "|" in this way. This can be used inside groups (see
> below) as well. As the target string is scanned
12 matches
Mail list logo
