C # Packrat Parser

This library generates a C# parser for a language encoded into a Parsing Expression Grammar (PEG) along with optional semantic actions. The parser is implemented as a back-tracking recursive descent parser with memoization (i.e. a packrat parser) so it runs in linear time. The library has the follow advantages and disadvantages: +The language to be parsed is written using a PEG which provides an especially nice syntax for encoding languages (see the example below). +Parses are unambiguous: if a string parses then it has exactly one parse tree. +There is no need for a separate tokenization step. +The library makes it very easy to add semantic actions. +The library has good support for customizing error messages. +The library offers a lot of support for customization. -The library does not support left recursive rules. -The amount of memory used is proportional to the input size. -Not a lot of time