Alternative implementation of our command line parsing combinators
New combinators that return a pair of
- a traditional combinator parser, and
- a representation of the grammar that can be printed:
data P a = P Grammar (PM a)
data Grammar = ...
- No need for type system extensions. Pure Haskell 98 is enough!