3 ms·
RE the thread at https://lobste.rs/s/solbtw/this_is_dumbdown_alternative_markdown#c_bdrerg https://lobste.rs/s/solbtw/this_is_dumbdown_alternative_mark... could
by hyperpallium 7y ago
RE the thread at https://lobste.rs/s/solbtw/this_is_dumbdown_alternative_markdown#c_bdrerg https://lobste.rs/s/solbtw/this_is_dumbdown_alternative_mark... could you just write a parser (in Tree Notation) that that converts a language in Tree Notation into BNF?
e.g. to produce BNF of dumbdown
Also, to parse BNF and produce a (bare bones) version in Tree Notation.
This would make it more accessible while also demostrating its power.
- breck 7y agoThat's a really good idea! If you give it a shot, I'd be happy to add any features or fix any bugs that you come across in the Grammar language. I'd also be happy to do a screenshare to explain any questions you might have about Grammar before you get started (since the UX is still pretty bad--I apologize. Slowly getting there!).
- hyperpallium 7y agoIt was a challenge to you. Though thinking it over, it's grammar transformation, not the parsing that Tree Notation is for.