funcparserlib 0.3.5-1ubuntu1 source package in Ubuntu


funcparserlib (0.3.5-1ubuntu1) precise; urgency=low

  * Add test_numbers.diff updating expected output to match current
    upstream SVN changeset 788599d92a85. Fixes FTBFS. (Closes: #646645)
 -- Daniel T Chen <email address hidden>   Sat, 14 Jan 2012 23:00:33 -0500

Upload details

Uploaded by:
Daniel T Chen on 2012-01-15
Uploaded to:
Original maintainer:
Ubuntu Developers
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Precise release on 2012-01-15 universe python


Precise: [FULLYBUILT] i386


File Size SHA-256 Checksum
funcparserlib_0.3.5.orig.tar.gz 32.0 KiB 5ed38aae96fa27f1b1fbd96c56d85bd11903e748f77314a295370998fe83b86b
funcparserlib_0.3.5-1ubuntu1.diff.gz 2.8 KiB 912de106779265082efed7d7eea7ab5afab052d688656c9ab49bff815d220424
funcparserlib_0.3.5-1ubuntu1.dsc 1.2 KiB b5fb062df40981c55cb1a443096b5aa0513bc37554f0c9e4c53bcc0dea8772c0

Available diffs

View changes file

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.