How to Install and Uninstall python310-Parsley Package on openSuSE Tumbleweed
Last updated: November 24,2024
1. Install "python310-Parsley" package
This guide let you learn how to install python310-Parsley on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
python310-Parsley
Copied
2. Uninstall "python310-Parsley" package
Please follow the guidelines below to uninstall python310-Parsley on openSuSE Tumbleweed:
$
sudo zypper remove
python310-Parsley
Copied
3. Information about the python310-Parsley package on openSuSE Tumbleweed
Information for package python310-Parsley:
------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python310-Parsley
Version : 1.3-6.2
Arch : noarch
Vendor : openSUSE
Installed Size : 1009.7 KiB
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 : python310-Parsley
Version : 1.3-6.2
Arch : noarch
Vendor : openSUSE
Installed Size : 1009.7 KiB
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-.