Ubuntu
funcparserlib package

funcparserlib 0.3.6-7.1 source package in Ubuntu

Changelog

funcparserlib (0.3.6-7.1) unstable; urgency=medium

  * Non-maintainer upload.
  * Drop python2 support; Closes: #936569

 -- Sandro Tosi <email address hidden>  Thu, 24 Oct 2019 18:10:51 -0400

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 Pocket Published Component Section
Focal release universe python

Builds

Focal: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
funcparserlib_0.3.6-7.1.dsc 1.8 KiB 5b3bae94f1b95b8c0105d74924bb810cfb86169bfda5a88688f2b172a313b83e
funcparserlib_0.3.6.orig.tar.gz 29.7 KiB b7992eac1a3eb97b3d91faa342bfda0729e990bd8a43774c1592c091e563c91d
funcparserlib_0.3.6-7.1.debian.tar.xz 3.0 KiB e7fe80e886930680ac9cc5da62262c8f0c497239d504228f4deb3fff79d05046

Available diffs

No changes file available.

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.