Thanks everyone, the invRegexInf is perfect.
Thanks again,
Nathan
On 1 April 2010 10:17, Gabriel Genellina wrote:
> En Wed, 31 Mar 2010 12:23:48 -0300, Paul McGuire
> escribió:
>>
>> On Mar 31, 5:49 am, Nathan Harmston
>> wrote:
>>>
>>> I have a slightly complicated/medium sized regular expre
En Wed, 31 Mar 2010 12:23:48 -0300, Paul McGuire
escribió:
On Mar 31, 5:49 am, Nathan Harmston
wrote:
I have a slightly complicated/medium sized regular expression and I
want to generate all possible words that it can match (to compare
performance of regex against an acora based matcher).
T
On Mar 31, 5:49 am, Nathan Harmston
wrote:
> Hi everyone,
>
> I have a slightly complicated/medium sized regular expression and I
> want to generate all possible words that it can match (to compare
> performance of regex against an acora based matcher).
The pyparsing wiki Examples page includes t
On 2010-03-31, Nathan Harmston wrote:
> I have a slightly complicated/medium sized regular expression and I
> want to generate all possible words that it can match
>
> I was wondering if this possible in Python or possible using
> anything. Google doesnt seem to give any obvious answers.
We did
Nathan Harmston wrote:
I have a slightly complicated/medium sized regular expression
and I want to generate all possible words that it can match
(to compare performance of regex against an acora based
matcher). Using the regular expression as a grammar to
generate all words in its language. I was
En Wed, 31 Mar 2010 07:49:14 -0300, Nathan Harmston
escribió:
I have a slightly complicated/medium sized regular expression and I
want to generate all possible words that it can match (to compare
performance of regex against an acora based matcher). Using the
regular expression as a grammar t
Hi everyone,
I have a slightly complicated/medium sized regular expression and I
want to generate all possible words that it can match (to compare
performance of regex against an acora based matcher). Using the
regular expression as a grammar to generate all words in its language.
I was wondering
