How to Install and Uninstall python310-spark_parser Package on openSuSE Tumbleweed
Last updated: November 08,2024
1. Install "python310-spark_parser" package
Please follow the instructions below to install python310-spark_parser on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
python310-spark_parser
Copied
2. Uninstall "python310-spark_parser" package
This guide let you learn how to uninstall python310-spark_parser on openSuSE Tumbleweed:
$
sudo zypper remove
python310-spark_parser
Copied
3. Information about the python310-spark_parser package on openSuSE Tumbleweed
Information for package python310-spark_parser:
-----------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python310-spark_parser
Version : 1.8.9-3.19
Arch : noarch
Vendor : openSUSE
Installed Size : 155.9 KiB
Installed : No
Status : not installed
Source package : python-spark_parser-1.8.9-3.19.src
Upstream URL : https://github.com/rocky/python-spark/
Summary : An Earley-Algorithm Context-free grammar Parser Toolkit
Description :
SPARK stands for Scanning, Parsing, and Rewriting Kit. It uses Jay
Earley's algorithm for parsing context-free grammars, and comes with
some generic Abstract Syntax Tree routines. There is also a prototype
scanner which does its job by combining Python regular expressions.
Please Note: Earley algorithm parsers are almost linear when given an LR
grammar. These are grammars which are left-recursive.
-----------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python310-spark_parser
Version : 1.8.9-3.19
Arch : noarch
Vendor : openSUSE
Installed Size : 155.9 KiB
Installed : No
Status : not installed
Source package : python-spark_parser-1.8.9-3.19.src
Upstream URL : https://github.com/rocky/python-spark/
Summary : An Earley-Algorithm Context-free grammar Parser Toolkit
Description :
SPARK stands for Scanning, Parsing, and Rewriting Kit. It uses Jay
Earley's algorithm for parsing context-free grammars, and comes with
some generic Abstract Syntax Tree routines. There is also a prototype
scanner which does its job by combining Python regular expressions.
Please Note: Earley algorithm parsers are almost linear when given an LR
grammar. These are grammars which are left-recursive.