Replies: 2 comments
-
In fact, one could write a project that parses this notation with the help of this project 🤔 |
Beta Was this translation helpful? Give feedback.
0 replies
-
That would be pretty sweet indeed :-) One way to do ABNF->parsica (or at least make it easier) would be to have a ABNF namespace in Parsica with its own set of parsers and combinators that strictly follow ABNF terminology and meaning. Not a priority for me right now, too much other things to get to 1.0. But if you want to build this, I'd be happy to help or pair with you to get you started. |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
It's just an idea to somehow support or parse things in accordance with the ABNF notation (https://en.wikipedia.org/wiki/Augmented_Backus%E2%80%93Naur_form). At present, a lot of RFCs contain definitions that can be implemented in accordance with ABNF. One example:
Macro definition (from SPF RFC7208):
At the moment, it would look more like this:
Of course, you can work it out manually now, but I leave this idea here. Thanks for this excellent library 👏
Beta Was this translation helpful? Give feedback.
All reactions