My favorites | Sign in
Project Home Downloads Wiki Issues Source
Repository:
Checkout   Browse   Changes   Clones  
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
from setuptools import setup

setup(name='LEPL',
version='5.1.1',
description='A Parser Library for Python 2.6+/3+: Recursive Descent; Full Backtracking',
long_description='''
LEPL is a recursive descent parser, written in Python, which has a a friendly,
easy-to-use syntax. The underlying implementation includes
several features that make it more powerful than might be expected.

For example, it is not limited by the Python stack, because it uses
trampolining and co-routines. Multiple parses can be found for ambiguous
grammars and it can also handle left-recursive grammars.

The aim is a powerful, extensible parser that will also give solid, reliable
results to first-time users.

`Release 5 <http://www.acooke.org/lepl/lepl5.0.html>`_ has simpler stream
(input) handling. Memoisation, line-aware lexing and memory use have also
been revised. These changes make future extension easier, fix several bugs,
and improve performance.

Features
--------

* **Parsers are Python code**, defined in Python itself. No separate
grammar is necessary.

* **Friendly syntax** using Python's operators allows grammars
to be defined in a declarative style close to BNF.

* Integrated, optional **lexer** simplifies handling whitespace.

* Built-in **AST support** with support for iteration, traversal and
re--writing.

* Generic, pure-Python approach supports parsing a wide variety of data
including **bytes** (Python 3+ only).

* **Well documented** and easy to extend.

* **Unlimited recursion depth**. The underlying algorithm is
recursive descent, which can exhaust the stack for complex grammars
and large data sets. LEPL avoids this problem by using Python
generators as coroutines (aka "trampolining").

* **Parser rewriting**. The parser can itself be manipulated by
Python code. This gives unlimited opportunities for future
expansion and optimisation.

* Support for ambiguous grammars (**complete backtracking**). A
parser can return more than one result (aka **"parse forests"**).

* Parsers can be made more **efficient** with automatic memoisation ("packrat
parsing").

* Memoisation can detect and control **left-recursive grammars**. Together
with LEPL's support for ambiguity this means that "any" grammar can be
supported.

* Trace and resource management, including **"deepest match" diagnostics**
and the ability to limit backtracking.
''',
author='Andrew Cooke',
author_email='andrew@acooke.org',
url='http://www.acooke.org/lepl/',
packages=['lepl', 'lepl._test', 'lepl._example',
'lepl.apps', 'lepl.apps._test',
'lepl.bin', 'lepl.bin._test', 'lepl.bin._example',
'lepl.contrib',
'lepl.core', 'lepl.core._test',
'lepl.lexer', 'lepl.lexer._test', 'lepl.lexer._example',
'lepl.lexer.lines', 'lepl.lexer.lines._test', 'lepl.lexer.lines._example',
'lepl.matchers', 'lepl.matchers._test',
'lepl.regexp', 'lepl.regexp._test',
'lepl.stream', 'lepl.stream._test',
'lepl.support', 'lepl.support._test',
],
package_dir = {'':'src'},
keywords = "parser",
classifiers=['Development Status :: 5 - Production/Stable',
'Intended Audience :: Developers',
'License :: OSI Approved :: GNU Library or Lesser General Public License (LGPL)',
'License :: OSI Approved :: Mozilla Public License 1.1 (MPL 1.1)',
'Natural Language :: English',
'Operating System :: OS Independent',
'Programming Language :: Python :: 3',
'Programming Language :: Python :: 3.0',
'Programming Language :: Python :: 3.1',
'Programming Language :: Python :: 3.2',
'Programming Language :: Python :: 2.6',
'Programming Language :: Python :: 2.7',
'Topic :: Software Development',
'Topic :: Software Development :: Libraries',
'Topic :: Software Development :: Libraries :: Python Modules',
'Topic :: Text Processing',
'Topic :: Text Processing :: Filters',
'Topic :: Text Processing :: General',
'Topic :: Utilities'
]
)

Change log

362939563a30 by andrew cooke <and...@acooke.org> on Apr 7, 2012   Diff
dynamic variables
Go to: 
Project members, sign in to write a code review

Older revisions

20a91fcca2ac by andrew cooke <and...@acooke.org> on Mar 18, 2012   Diff
5.1 with Reduce()
7078985aebe3 by andrew cooke <and...@acooke.org> on Mar 17, 2012   Diff
make strings more string-like
431aadb3c826 by and...@acooke.org on Jan 8, 2012   Diff
releasing 5.0.1
All revisions of this file

File info

Size: 4533 bytes, 101 lines
Powered by Google Project Hosting