How to Install and Uninstall python3-spark_parser Package on openSUSE Leap
Last updated: November 26,2024
1. Install "python3-spark_parser" package
Please follow the guidance below to install python3-spark_parser on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
python3-spark_parser
Copied
2. Uninstall "python3-spark_parser" package
This is a short guide on how to uninstall python3-spark_parser on openSUSE Leap:
$
sudo zypper remove
python3-spark_parser
Copied
3. Information about the python3-spark_parser package on openSUSE Leap
Information for package python3-spark_parser:
---------------------------------------------
Repository : Main Repository
Name : python3-spark_parser
Version : 1.8.9-bp155.2.13
Arch : noarch
Vendor : openSUSE
Installed Size : 165.5 KiB
Installed : No
Status : not installed
Source package : python-spark_parser-1.8.9-bp155.2.13.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 : Main Repository
Name : python3-spark_parser
Version : 1.8.9-bp155.2.13
Arch : noarch
Vendor : openSUSE
Installed Size : 165.5 KiB
Installed : No
Status : not installed
Source package : python-spark_parser-1.8.9-bp155.2.13.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.