LEPL 2.3.2

A Parser Library for Python 3 (and 2.6): Recursive Descent; Full Backtracking

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 2.3 provides optimisation via regular expressions. A detailed example shows the benefits. Release 2.3.1 fixes a packaging error.

Features

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

• Friendly syntax using Python’s operators.

• Built-in AST support (a generic Node class). Improved support for the visitor pattern and tree re–writing.

• 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”).

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

• Packrat parsing. Parsers can be made much more efficient with automatic memoisation.

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

• Left recursive grammars. Memoisation can detect and control left–recursive grammars. Together with LEPL’s support for ambiguity this means that “any” grammar can be supported.

• Pluggable trace and resource management, including “deepest match” diagnostics and the ability to limit backtracking.