Yes, what you do is you write a ABNF parser using one of those grammars, then you parse your abnf into one of those grammars, and then you're done :)
Oh look, Convert Augmented BNF (ABNF) to Regexp::Grammars
OTOH, (I think) SLIF has a few good points about BNF
In reply to Re: How to create a parser from an [AE]BNF grammar
by Anonymous Monk
in thread How to create a parser from an [AE]BNF grammar
by voj
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |