funcparserlib 0.3.6+dfsg1-1build1 source package in Ubuntu

Changelog

funcparserlib (0.3.6+dfsg1-1build1) hirsute; urgency=medium

  * No change rebuild with fixed ownership.

 -- Dimitri John Ledkov <email address hidden>  Tue, 16 Feb 2021 17:03:12 +0000

Upload details

Uploaded by:
Dimitri John Ledkov on 2021-02-16
Uploaded to:
Hirsute
Original maintainer:
Ubuntu Developers
Architectures:
all
Section:
python
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Hirsute release on 2021-02-17 universe python

Builds

Hirsute: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
funcparserlib_0.3.6+dfsg1.orig.tar.xz 13.2 KiB d5edfd51c0951a9b628aee5136ebdeb42ee71a8b59e5d14621b25796b922cc25
funcparserlib_0.3.6+dfsg1-1build1.debian.tar.xz 3.3 KiB 16fb929fe92069a04122c08394b7c36c6bc556cc275acbb73028e983f9755f96
funcparserlib_0.3.6+dfsg1-1build1.dsc 1.9 KiB a1de7db086dc777e8267ed864e7b6cd3d010e0838103adf1fd21cfe09d778f12

View changes file

Binary packages built by this source

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.