veparser 1.0.0

Simple to use. Simple to learn. Although hard to understand how it works internally.
No dependency on any grammar language, only pure C# code can be used to design and implement a parser.
Rich grammar authoring preset. The ParserBase is shiped with a whole bunch of useful parser combinators like : seq, any, zeroOrMore, zeroOrOne, oneOrMore, zeroOrMoreAny, zeroOeMoreSeq, oneOrMoreAny, oneOrMoreSeq and deleimitedList and mixture.
Producing output result from the parsed content. (A.k.a Abstract Syntax Tree generation).
Extensible. Although there are lots of useful combinators you can wrote your own combinators to the library. I am looking to hearing from you about any new combinator that you may suggest.
Probably fast, if you wrote a neat grammar it should be fast. I need to evaluate performance more percisely to claim about it speed.
Grammar debugging. Yes that's it, you can monitor the executation of the parser, and also you can put breakpoints in your parser code to see how it is performing. (_Although this features require some improvements, so the next version would be even better).
Shiped with a default Lexer.
Lightweight library, with no dependency to any other library. Just you need .Net 4 to use it. And itself is only a couple of essential classes and some other helper classes.