Re: Nested comments

[Hans Aberg]

At 12:26 -0400 2003/07/07, address@hidden wrote:
>>It is clear that the scanner chokes long before that
>16k limit: The amount
>>of nest comments I used to test my example code was
>about 16k, but because
>>of the nesting, most rule matches should actually be a
>great deal smaller.
>>It would be good to know exactly what is the
>bottleneck. -- Perhaps you
>>have something that grows in say quadratic time
>complexity and needs to be
>>changed.
>
>What do you mean by chokes?

It could be something like a O(n^2) time complexity where n is the rule
match length. If n becomes large, it will appear as though there is a
threshold where the lexer chokes.

>What happens?

But I have no idea exactly what happens. My hunch is just that one might
look it up.

  Hans Aberg