| 1 |
Source: funcparserlib |
| 2 |
Maintainer: Debian Python Team <[email protected]> |
| 3 |
Uploaders: |
| 4 |
Kouhei Maeda <[email protected]>, |
| 5 |
Alexandre Detiste <[email protected]>, |
| 6 |
Build-Depends: |
| 7 |
debhelper-compat (= 13), |
| 8 |
dh-sequence-python3, |
| 9 |
pybuild-plugin-pyproject, |
| 10 |
python3-all, |
| 11 |
python3-poetry-core, |
| 12 |
Standards-Version: 4.7.3 |
| 13 |
Section: python |
| 14 |
Homepage: https://github.com/vlasovskikh/funcparserlib |
| 15 |
Vcs-Browser: https://salsa.debian.org/python-team/packages/funcparserlib |
| 16 |
Vcs-Git: https://salsa.debian.org/python-team/packages/funcparserlib.git |
| 17 |
|
| 18 |
Package: python3-funcparserlib |
| 19 |
Architecture: all |
| 20 |
Depends: |
| 21 |
${misc:Depends}, |
| 22 |
${python3:Depends}, |
| 23 |
Description: Recursive descent parsing library for python3 |
| 24 |
For python3. |
| 25 |
Parser combinators are just higher-order functions that take parsers as |
| 26 |
their arguments and return them as result values. Parser combinators are: |
| 27 |
. |
| 28 |
First-class values. Extremely composable. Tend to make the code quite compact. |
| 29 |
Resemble the readable notation of xBNF grammars. |
| 30 |
. |
| 31 |
Parsers made with funcparserlib are pure-Python LL(*) parsers. It means that |
| 32 |
it's very easy to write them without thinking about look-aheads and all that |
| 33 |
hardcore parsing stuff. But the recursive descent parsing is a rather slow |
| 34 |
method compared to LL(k) or LR(k) algorithms. |
| 35 |
. |
| 36 |
So the primary domain for funcparserlib is parsing little languages or external |
| 37 |
DSLs (domain specific languages). |
| 38 |
. |
| 39 |
The library itself is very small. Its source code is only 0.5 KLOC, with lots |
| 40 |
of comments included. It features the longest parsed prefix error reporting, |
| 41 |
as well as a tiny lexer generator for token position tracking. |