How to Install and Uninstall python311-Parsley Package on openSuSE Tumbleweed
Last updated: December 27,2024
1. Install "python311-Parsley" package
Please follow the guidance below to install python311-Parsley on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
python311-Parsley
Copied
2. Uninstall "python311-Parsley" package
This tutorial shows how to uninstall python311-Parsley on openSuSE Tumbleweed:
$
sudo zypper remove
python311-Parsley
Copied
3. Information about the python311-Parsley package on openSuSE Tumbleweed
Information for package python311-Parsley:
------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python311-Parsley
Version : 1.3-6.2
Arch : noarch
Vendor : openSUSE
Installed Size : 1.4 MiB
Installed : No
Status : not installed
Source package : python-Parsley-1.3-6.2.src
Upstream URL : https://github.com/pyga/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 : openSUSE-Tumbleweed-Oss
Name : python311-Parsley
Version : 1.3-6.2
Arch : noarch
Vendor : openSUSE
Installed Size : 1.4 MiB
Installed : No
Status : not installed
Source package : python-Parsley-1.3-6.2.src
Upstream URL : https://github.com/pyga/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-.