Information for RPM python-parsley-1.3-31.fc41.src.rpm
| ID | 249696 | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Build | python-parsley-1.3-31.fc41 | ||||||||||
| Name | python-parsley | ||||||||||
| Version | 1.3 | ||||||||||
| Release | 31.fc41 | ||||||||||
| Epoch | |||||||||||
| Arch | src | ||||||||||
| Draft | False | ||||||||||
| Summary | Parsing and pattern matching made easy | ||||||||||
| Description | A parser generator library based on OMeta, and other useful parsing tools. Parsley is a parsing library for people who find parsers scary or annoying. I wrote it because I wanted to parse a programming language, and tools like PLY or ANTLR or Bison were very hard to understand and integrate into my Python code. Most parser generators are based on LL or LR parsing algorithms that compile to big state machine tables. It was like I had to wake up a different section of my brain to understand or work on grammar rules. Parsley, like pyparsing and ZestyParser, uses the PEG algorithm, so each expression in the grammar rules works like a Python expression. In particular, alternatives are evaluated in order, unlike table-driven parsers such as yacc, bison or PLY. Parsley is an implementation of OMeta, an object-oriented pattern-matching language developed by Alessandro Warth at thesis, which provides a detailed description of OMeta: http://www.vpri.org/pdf/tr2008003_experimenting.pdf | ||||||||||
| Build Time | 2024-06-10 07:24:59 GMT | ||||||||||
| Size | 117.57 KB | ||||||||||
| e7ff2f23ea2dc3779a994b05f009dcfd | |||||||||||
| License | MIT | ||||||||||
| Buildroot | f41-build-869646-15955 | ||||||||||
| Provides |
|
||||||||||
| Obsoletes | No Obsoletes | ||||||||||
| Conflicts | No Conflicts | ||||||||||
| Requires |
|
||||||||||
| Recommends | No Recommends | ||||||||||
| Suggests | No Suggests | ||||||||||
| Supplements | No Supplements | ||||||||||
| Enhances | No Enhances | ||||||||||
| Files |
|
||||||||||
| Component of | No Buildroots | ||||||||||
