Download List

프로젝트 설명

LEPL is a recursive descent parser library written
in Python. It is based on parser combinator
libraries popular in functional programming, but
also exploits Python language features. Operators
provide a friendly syntax, and the consistent use
of generators supports full backtracking and
resource management. Backtracking implies that a
wide variety of grammars are supported; appropriate memoisation ensures that even left-recursive grammars terminate.

System Requirements

System requirement is not defined
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.

2010-04-22 01:30 Back to release list
4.0

이것은 라이브러리를 단순화 많은 변화와 주요 릴리스하고있다 그것보다 효율적이고 사용하기 쉬운. 모든 구성은 이제 "matcher.config"속성을 통해 수 있습니다. matcher (이이 경우 예상되는 부분 일치를 비활성화할 수 있습니다) 전체 입력과 일치하지 않을 경우 깊은 일치하는 위치와 예외가 발생합니다. 새로운 matchers이 함수를 사용하여 장식 정의할 수 있습니다. 내부적으로, 이것은보다 효율적으로 처리됩니다 비저장입니다 matchers을 감지하는 데 사용됩니다. 의 처리보다 일반적인되었습니다, 새로운 확장 기능을 활성화 변환합니다. 지원을 디버깅 현재 변수 값을 추적이 포함됩니다.
Tags: Major feature enhancements
This is a major release with many changes that simplify the library, making it more efficient and easier to use. All configuration is now via the "matcher.config" attribute. An exception with deepest match location is raised if a matcher fails to match the entire input (this can be disabled if partial matches are expected). New matchers can be defined using decorated functions. Internally, this is used to detect stateless matchers, which are handled more efficiently. The handling of transforms has been made more general, enabling new extensions. Debugging support now includes tracing variable values.

Project Resources