Hello, all. I have released 'Peggy' a new parser generator . It is based on Parsing Expression Grammer (PEG) [1], and generates efficient packrat parsers. # Where to get it * Hackage page (http://hackage.haskell.org/package/peggy) * github repository (https://github.com/tanakh/peggy). * Some documents are at (http://tanakh.github.com/Peggy/). # Advantage * Simple and Powerful syntax * No shift/reduce conflict * Unlimited look-ahead * You don't need to prepare separated Scanner * Linear time complexity * Based on modern Haskell ecosystem (bytestring, text, ListLike, Monads, etc...) * Support to use and generate Quasi Quoters # Examples Here are few example of parsers: * http://tanakh.github.com/Peggy/example.html * https://github.com/tanakh/Peggy/blob/master/example/Json.hs There is a self defined parser of peggy syntax, used for bootstrapping: * https://github.com/tanakh/Peggy/blob/master/bootstrap/peggy.peggy Please try it and give me feedbacks! Thanks, [1]: http://en.wikipedia.org/wiki/Parsing_expression_grammar -- Hideyuki Tanaka