How to Install and Uninstall python312-Parsley Package on openSuSE Tumbleweed
Last updated: December 27,2024
1. Install "python312-Parsley" package
Here is a brief guide to show you how to install python312-Parsley on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
python312-Parsley
Copied
2. Uninstall "python312-Parsley" package
This guide covers the steps necessary to uninstall python312-Parsley on openSuSE Tumbleweed:
$
sudo zypper remove
python312-Parsley
Copied
3. Information about the python312-Parsley package on openSuSE Tumbleweed
Information for package python312-Parsley:
------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python312-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 : python312-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-.