/usr/lib/python2.7/dist-packages/LEPL-5.1.3.egg-info/PKG-INFO is in python-lepl 5.1.3-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | Metadata-Version: 1.1
Name: LEPL
Version: 5.1.3
Summary: A Parser Library for Python 2.6+/3+: Recursive Descent; Full Backtracking
Home-page: http://www.acooke.org/lepl/
Author: Andrew Cooke
Author-email: andrew@acooke.org
License: UNKNOWN
Description:
THIS PROJECT IS NO LONGER DEVELOPED. PLEASE SEE THE `SITE
<http://www.acooke.org/lepl>` FOR MORE INFORMATION.
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.
Keywords: parser
Platform: UNKNOWN
Classifier: Development Status :: 5 - Production/Stable
Classifier: Intended Audience :: Developers
Classifier: License :: OSI Approved :: GNU Library or Lesser General Public License (LGPL)
Classifier: License :: OSI Approved :: Mozilla Public License 1.1 (MPL 1.1)
Classifier: Natural Language :: English
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.0
Classifier: Programming Language :: Python :: 3.1
Classifier: Programming Language :: Python :: 3.2
Classifier: Programming Language :: Python :: 2.6
Classifier: Programming Language :: Python :: 2.7
Classifier: Topic :: Software Development
Classifier: Topic :: Software Development :: Libraries
Classifier: Topic :: Software Development :: Libraries :: Python Modules
Classifier: Topic :: Text Processing
Classifier: Topic :: Text Processing :: Filters
Classifier: Topic :: Text Processing :: General
Classifier: Topic :: Utilities
|