How to Install and Uninstall python3-Parsley Package on openSUSE Leap
Last updated: December 25,2024
1. Install "python3-Parsley" package
Please follow the guidelines below to install python3-Parsley on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
python3-Parsley
Copied
2. Uninstall "python3-Parsley" package
Please follow the steps below to uninstall python3-Parsley on openSUSE Leap:
$
sudo zypper remove
python3-Parsley
Copied
3. Information about the python3-Parsley package on openSUSE Leap
Information for package python3-Parsley:
----------------------------------------
Repository : Main Repository
Name : python3-Parsley
Version : 1.3-bp155.2.13
Arch : noarch
Vendor : openSUSE
Installed Size : 1.2 MiB
Installed : No
Status : not installed
Source package : python-Parsley-1.3-bp155.2.13.src
Upstream URL : https://github.com/washort/parsley
Summary : PEG algorithm based parser generator
Description :
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-.
----------------------------------------
Repository : Main Repository
Name : python3-Parsley
Version : 1.3-bp155.2.13
Arch : noarch
Vendor : openSUSE
Installed Size : 1.2 MiB
Installed : No
Status : not installed
Source package : python-Parsley-1.3-bp155.2.13.src
Upstream URL : https://github.com/washort/parsley
Summary : PEG algorithm based parser generator
Description :
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-.