Category talk:Parsing algorithms

This category is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

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)[reply]