4 ms·
Why you think ABNFs are machine friendly? Is it that easy to parse ABNFs that we are flooding with libraries? Just because it is a formal system it doesn’t mea
by noncoml 9y ago
Why you think ABNFs are machine friendly? Is it that easy to parse ABNFs that we are flooding with libraries?
Just because it is a formal system it doesn’t mean it’s machine friendly.
- saurik 9y agoHow to work with BNF grammars is seriously second year computer science... if you wanted to parse that precise format it should probably take something like twenty minutes using an existing parsing framework, and then you can generate anything you want. I could see making "parse SMTP" a homework assignment for a compilers class... if only it were challenging ;P. FWIW, when I implemented the SMTP/IMAP specs, I spent a few hours first writing my own parser combinator framework (to be 100% clear: from scratch, with no reference) and then made short work of getting these specific grammars fully implemented.
- deleted 9y ago[deleted]
- noncoml 9y ago> when I implemented the SMTP/IMAP spec Link to the code? > I spent a few hours first writing my own parser combinator framework (to be 100% clear: from scratch, with no reference) I am sure you did. Like when you rolled out your own crypto in 5 minutes. Or the time you rewrote FB in a weekend.