There is Happy and Alex for Haskell, and also some older tools like Frown and BNFC. But the coolest thing about Parsec is that you can construct the parser at

There is Happy and Alex for Haskell, and also some older tools like Frown and BNFC. But the coolest thing about Parsec is that you can construct the parser at run-time, for instance calculating it after scanning a file for infix declarations. If you want custom infix in a yaccy grammar, you have to walk the AST afterwards to fix the application precedence.