Moved to https://parsing.stereobooster.com/
- Parsing with derivatives can easily support Conjunctive grammar, which can parse not context-free grammar, for example
$\set{a^nb^nc^n \mid n \geq 0}$ . This is not something innovative per se, but I haven't seen it mentioned anywhere in reviewed publications. - Parsing with derivatives can support Conjunctive grammar with right context, if we add recursion to REwLA
- I showed how to express PEG in terms of REwLA with recursion. Which allows to define derivative formula for PEG.
- This allows to create variation of PEG with unordered choice. Related work:
- By the nature of parsing with derivatives it doesn't have issues with left recursion. Related works:
- It can open door to understand expressive power of PEG (it is not contained within context-free, but also can express some context-sensitive languages)