python/python-Parsley
SHA256
15
0
Fork 0
forked from pool/python-Parsley
Code Pull Requests Activity

Accepting request 631532 from home:jengelh:branches:devel:languages:python

Browse Source 
- Use noun phrase in summary. Strip storytelling from description.

OBS-URL: https://build.opensuse.org/request/show/631532
OBS-URL: https://build.opensuse.org/package/show/devel:languages:python/python-Parsley?expand=0&rev=7
This commit is contained in:
Tomáš Chvátal
2018-08-25 20:09:36 +00:00
committed by Git OBS Bridge
parent ce0969ee9a
commit 5c3dc0c9e5
2 changed files with 13 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
python-Parsley.changes
View File

@@ -1,3 +1,8 @@
-------------------------------------------------------------------
Sat Aug 25 18:05:32 UTC 2018 - jengelh@inai.de
- Use noun phrase in summary. Strip storytelling from description.
-------------------------------------------------------------------
Thu Aug 23 11:17:06 UTC 2018 - tchvatal@suse.com

20
python-Parsley.spec
View File

@@ -22,7 +22,7 @@
Name: python-Parsley
Version: 1.3
Release: 0
Summary: Parsing and pattern matching made easy
Summary: PEG algorithm based parser generator
License: MIT
Group: Development/Libraries/Python
URL: http://github.com/washort/parsley
@@ -39,17 +39,13 @@ BuildArch: noarch
%python_subpackages
%description
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 a parsing library. Most parser generators like ANTLR and
Bison are based on LL or LR parsing algorithms that compile to big
state machine tables, whereas 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.
The binaries are prefixed with parsley-.