On 7/7/12 6:05 AM, Dmitry Olshansky wrote:
I can tell you that they are not slower then one another in principle. Quality of implementations trumps every theoretical aspect here. LALR is usually fast even if implemented by book but they are hard to optimize futher and quite restrictive on "semantic extensions".
Isn't it the case that PEG require more memory for certain grammars? Andrei
