| Name | LEPL JSON |
| Version |
5.1.3
JSON |
| download |
| home_page | http://www.acooke.org/lepl/ |
| Summary | A Parser Library for Python 2.6+/3+: Recursive Descent; Full Backtracking |
| upload_time | 2012-06-10 03:52:06 |
| maintainer | |
| docs_url | https://pythonhosted.org/LEPL/ |
| author | Andrew Cooke |
| requires_python | None |
| license | UNKNOWN |
| keywords |
parser
|
| VCS |
|
| bugtrack_url |
|
| requirements |
No requirements were recorded.
|
| Travis-CI |
No Travis.
|
| coveralls test coverage |
No coveralls.
|
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.
Raw data
{
"_id": null,
"home_page": "http://www.acooke.org/lepl/",
"name": "LEPL",
"maintainer": "",
"docs_url": "https://pythonhosted.org/LEPL/",
"requires_python": null,
"maintainer_email": "",
"keywords": "parser",
"author": "Andrew Cooke",
"author_email": "andrew@acooke.org",
"download_url": "https://files.pythonhosted.org/packages/bb/89/5acd0982ca17258d13df855114364140712ac59ccdb835093c385ddc8dca/LEPL-5.1.3.tar.gz",
"platform": "UNKNOWN",
"description": "THIS PROJECT IS NO LONGER DEVELOPED. PLEASE SEE THE \r\n`SITE <http://www.acooke.org/lepl>`_ FOR MORE INFORMATION.\r\n\r\nLEPL is a recursive descent parser, written in Python, which has a a friendly,\r\neasy-to-use syntax. The underlying implementation includes\r\nseveral features that make it more powerful than might be expected.\r\n\r\nFor example, it is not limited by the Python stack, because it uses\r\ntrampolining and co-routines. Multiple parses can be found for ambiguous\r\ngrammars and it can also handle left-recursive grammars.\r\n\r\nThe aim is a powerful, extensible parser that will also give solid, reliable\r\nresults to first-time users.\r\n\r\n`Release 5 <http://www.acooke.org/lepl/lepl5.0.html>`_ has simpler stream\r\n(input) handling. Memoisation, line-aware lexing and memory use have also \r\nbeen revised. These changes make future extension easier, fix several bugs, \r\nand improve performance.\r\n\r\nFeatures\r\n--------\r\n\r\n* **Parsers are Python code**, defined in Python itself. No separate\r\n grammar is necessary.\r\n\r\n* **Friendly syntax** using Python's operators allows grammars\r\n to be defined in a declarative style close to BNF.\r\n\r\n* Integrated, optional **lexer** simplifies handling whitespace.\r\n\r\n* Built-in **AST support** with support for iteration, traversal and\r\n re--writing.\r\n\r\n* Generic, pure-Python approach supports parsing a wide variety of data\r\n including **bytes** (Python 3+ only).\r\n\r\n* **Well documented** and easy to extend.\r\n\r\n* **Unlimited recursion depth**. The underlying algorithm is\r\n recursive descent, which can exhaust the stack for complex grammars\r\n and large data sets. LEPL avoids this problem by using Python\r\n generators as coroutines (aka \"trampolining\").\r\n\r\n* **Parser rewriting**. The parser can itself be manipulated by\r\n Python code. This gives unlimited opportunities for future\r\n expansion and optimisation.\r\n\r\n* Support for ambiguous grammars (**complete backtracking**). A\r\n parser can return more than one result (aka **\"parse forests\"**).\r\n\r\n* Parsers can be made more **efficient** with automatic memoisation (\"packrat\r\n parsing\").\r\n\r\n* Memoisation can detect and control **left-recursive grammars**. Together\r\n with LEPL's support for ambiguity this means that \"any\" grammar can be\r\n supported.\r\n\r\n* Trace and resource management, including **\"deepest match\" diagnostics** \r\n and the ability to limit backtracking.",
"bugtrack_url": null,
"license": "UNKNOWN",
"summary": "A Parser Library for Python 2.6+/3+: Recursive Descent; Full Backtracking",
"version": "5.1.3",
"project_urls": {
"Download": "UNKNOWN",
"Homepage": "http://www.acooke.org/lepl/"
},
"split_keywords": [
"parser"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "bb895acd0982ca17258d13df855114364140712ac59ccdb835093c385ddc8dca",
"md5": "5f653984c57ad8efad828c5153660743",
"sha256": "a8715c709308350ce4afed5d525682656886d38141387ec87d44421da8d41397"
},
"downloads": -1,
"filename": "LEPL-5.1.3.tar.gz",
"has_sig": false,
"md5_digest": "5f653984c57ad8efad828c5153660743",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 203680,
"upload_time": "2012-06-10T03:52:06",
"upload_time_iso_8601": "2012-06-10T03:52:06.699935Z",
"url": "https://files.pythonhosted.org/packages/bb/89/5acd0982ca17258d13df855114364140712ac59ccdb835093c385ddc8dca/LEPL-5.1.3.tar.gz",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "fd5d7ec76725dab377d26cfbbb769c7fd5f7126a1cbf68934887e30514f04df2",
"md5": "64ae409c0582231112406fff3b6746f2",
"sha256": "da6dfa01bbd449f8544857b13474ad52fcca30a5d30de96271c70f34c7a3f96e"
},
"downloads": -1,
"filename": "LEPL-5.1.3.zip",
"has_sig": false,
"md5_digest": "64ae409c0582231112406fff3b6746f2",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 373567,
"upload_time": "2012-06-10T03:52:13",
"upload_time_iso_8601": "2012-06-10T03:52:13.416400Z",
"url": "https://files.pythonhosted.org/packages/fd/5d/7ec76725dab377d26cfbbb769c7fd5f7126a1cbf68934887e30514f04df2/LEPL-5.1.3.zip",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2012-06-10 03:52:06",
"github": false,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"lcname": "lepl"
}
