I'm looking for a parser generator that given an EBNF for a LL(k) language will give me a C# parser and generate classes the types defined in the EBNF.
Gold is OK as far a parser generators go.
ANTLR (nothing else to say)
Find Irony in http://irony.codeplex.com/
PROS: It is simple CONS: -Lack of document -Rather Slow
There is a new parser generator on the block called LLLPG, that supports LL(k) grammars and zero-width assertions. It can be used without a runtime library (a base class suffices). The documentation is fairly detailed now, and I have used LLLPG to parse most of a dialect of C# called Enhanced C# (which, in fact, is the main input language of LLLPG). The input syntax is not EBNF, though (it's sort of a mashup of C# + ANTLR-style code).
Full disclosure: I wrote it. Questions welcome.
Grammatica supports LL(k). http://grammatica.percederberg.net/
Coco/R (from the SSW - "Johannes Kepler" University Linz)
来源：https://stackoverflow.com/questions/1194584/what-is-a-good-c-sharp-compiler-compiler-parser-generator