funcparserlib 0.3.6-7 source package in Ubuntu
Changelog
funcparserlib (0.3.6-7) unstable; urgency=medium
* debian/control
- Standards-Version: Bumps version to 3.9.8.
- Homepage: Fixes obsolete-url-in-packaging.
-- Kouhei Maeda <email address hidden> Sat, 02 Jul 2016 07:01:57 +0900
Upload details
- Uploaded by:
- Kouhei Maeda
- Uploaded to:
- Sid
- Original maintainer:
- Kouhei Maeda
- Architectures:
- all
- Section:
- python
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Bionic | release | universe | python |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| funcparserlib_0.3.6-7.dsc | 1.9 KiB | 7b8df9df118e5172db90ebc5af40c719ce4edbf2b466a0dea93ede4db436ca86 |
| funcparserlib_0.3.6.orig.tar.gz | 29.7 KiB | b7992eac1a3eb97b3d91faa342bfda0729e990bd8a43774c1592c091e563c91d |
| funcparserlib_0.3.6-7.debian.tar.xz | 3.0 KiB | 4f4c63c8da91c814114365b98b966107277264c6e9d1dc8b601f89c6e28fdbdf |
Available diffs
- diff from 0.3.6-6 to 0.3.6-7 (538 bytes)
No changes file available.
Binary packages built by this source
- python-funcparserlib: 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).
.
The library itself is very small. Its source code is only 0.5 KLOC, with lots
of comments included. It features the longest parsed prefix error reporting,
as well as a tiny lexer generator for token position tracking.
- python3-funcparserlib: Recursive descent parsing library for python3
For python3.
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).
.
The library itself is very small. Its source code is only 0.5 KLOC, with lots
of comments included. It features the longest parsed prefix error reporting,
as well as a tiny lexer generator for token position tracking.
