Recursive descent parsing library based on functional combinators
Parser combinators are just higher-order functions that take parsers as their arguments and return them as result values. Parser combinators are: * First-class values * Extremely composable * Tend to make the code quite compact * Resemble the readable notation of xBNF grammars Parsers made with funcparserlib are pure-Python LL(*) parsers. It means that it's very easy to write them without thinking about look-aheads and all that hardcore parsing stuff. But the recursive descent parsing is a rather slow method compared to LL(k) or LR(k) algorithms. So the primary domain for funcparserlib is parsing little languages or external DSLs (domain specific languages).
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 1.0.0a0-1.prerelease.fc36 | - |
Fedora 35 | 0.3.6-28.fc35 | - |
Fedora 34 | 0.3.6-26.fc34 | - |
You can contact the maintainers of this package via email at
python-funcparserlib dash maintainers at fedoraproject dot org
.