Lexer and parser generators using CTFE

Andrei Alexandrescu SeeWebsiteForEmail at erdani.org
Wed Feb 29 09:34:41 PST 2012

On 2/29/12 11:15 AM, Nick Sabalausky wrote:
> "Andrei Alexandrescu"<SeeWebsiteForEmail at erdani.org>  wrote in message
> news:jiljsg$193s$1 at digitalmars.com...
>> On 2/28/12 1:52 PM, Dmitry Olshansky wrote:
>>> - have reasonable compile times and memory consumption (though it will
>>> only improve over time)
>> Yes. I guess PEGs have problems there.
> Probably LR, too, unless you build the state tables in a separate prior
> build step.

It's been a while since I read about PEGs (the packrat parser paper), 
but think it's a more fundamental issue with PEGs because they need to 
memoize several possible parses of the input.


More information about the Digitalmars-d mailing list