Category talk:Parsing algorithms

There should be good examples for grammars in: LL(2)\LL(1), SLR\LR(0), LALR(1)\SLR, LR(1)\LALR(1), CFG\LR(1) etc. I mean real examples, not something like “look, here is a conflict, but it can be resolved”, examples with unresolvable conflicts. There should also be an overview of relations between the different classes of languages (LL(k) ⊂?⊃ SLR). For non-experts it is really difficult to find such examples, prove their correctness and to determine all the relations. But these aspects are very important to understand the specific properties and power of the different parsing-algorithms.

I think most articles in this category are unfortunately not yet good. --Chricho (talk) 12:37, 11 September 2010 (UTC)