Now all it needs is a parser in 'examples/' that parses EBNF grammars and emits a parser in terms of these combinators.

It seems like it would be easy to create such a parser for PEGs, but the semantics here don’t seem like a good fit for context-free grammars where alternation is completely symmetrical.