1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
|
Source: funcparserlib
Priority: optional
Maintainer: Kouhei Maeda <mkouhei@palmtb.net>
Build-Depends: debhelper (>= 7.0.50~), python-all (>= 2.6), python-setuptools
Standards-Version: 3.9.3
Section: python
X-Python-Version: >= 2.6
Homepage: http://code.google.com/p/funcparserlib/
Package: python-funcparserlib
Architecture: all
Depends: ${misc:Depends}, ${python:Depends}
Description: 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.
|
