September 28, 2013 Re: std.d.lexer: pre-voting review / discussion | ||||
---|---|---|---|---|
| ||||
Posted in reply to Mehrdad | On Saturday, 28 September 2013 at 01:23:48 UTC, Mehrdad wrote:
> On Thursday, 12 September 2013 at 05:00:11 UTC, deadalnix wrote:
>> The problem is that it can cause a exponential (and I literally mean exponential here) amount of complexity.
>>
>> The alternative is to go for some ambiguous function/template parameters parsing and resolve at the end, but as template argument are themselves ambiguous type/expression/symbols, the amount of complexity in the parser is doomed to explode.
>
>
> Pretty sure a GLR parser handles that well within O(n^2) space. Nothing exponential necessary...
I meant time... Though it's true for space too.
|
Copyright © 1999-2021 by the D Language Foundation