Parsing Expression Library #1
Description
Story
As a user, I want a parsing expression library written so that I can define parsers easily without having to use a code generator.
Acceptance Criteria
- A parsing expression library exists
- Types exist for each kind of PEG expression, and each expression must take the form of an object
- These types should be simple, fulfilling a minimal interface with minimal dependencies.
- It must be simple to translate from a PEG grammar to a set of parsing objects.
- In particular, the user must not have to worry about which parsing strategy is used or whether memoizing is used, etc.
- The resulting parser should be not expose any mutable behaviour.
- Rules cannot be added to a parser, but must be defined using a builder.
- Individual expression objects must also not expose any mutable behaviour
- Memoization is an implementation detail and should be added transparently by the builder without any extra code when defining the parser.