How to Install and Uninstall peg Package on openSuSE Tumbleweed
Last updated: November 26,2024
1. Install "peg" package
Please follow the steps below to install peg on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
peg
Copied
2. Uninstall "peg" package
Please follow the instructions below to uninstall peg on openSuSE Tumbleweed:
$
sudo zypper remove
peg
Copied
3. Information about the peg package on openSuSE Tumbleweed
Information for package peg:
----------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : peg
Version : 0.1.20-1.2
Arch : x86_64
Vendor : openSUSE
Installed Size : 113.9 KiB
Installed : No
Status : not installed
Source package : peg-0.1.20-1.2.src
Upstream URL : https://piumarta.com/software/peg/
Summary : Recursive-Descent parser generators for C
Description :
peg(1) and leg(1) are tools for generating recursive-descent
parsers: programs that perform pattern matching on text. They
processes a Parsing Expression Grammar (PEG) to produce a program
that recognises legal sentences of that grammar. peg(1) processes
PEGs written using the original syntax described by Ford while
leg(1) processes PEGs written using slightly different syntax and
conventions that are intended to make it an attractive replacement
for parsers built with lex(1) and yacc(1). Unlike lex(1) and
yacc(1), peg(1) and leg(1) support unlimited backtracking, provide
ordered choice as a means for disambiguation, and can combine
scanning (lexical analysis) and parsing (syntactic analysis) into a
single activity.
----------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : peg
Version : 0.1.20-1.2
Arch : x86_64
Vendor : openSUSE
Installed Size : 113.9 KiB
Installed : No
Status : not installed
Source package : peg-0.1.20-1.2.src
Upstream URL : https://piumarta.com/software/peg/
Summary : Recursive-Descent parser generators for C
Description :
peg(1) and leg(1) are tools for generating recursive-descent
parsers: programs that perform pattern matching on text. They
processes a Parsing Expression Grammar (PEG) to produce a program
that recognises legal sentences of that grammar. peg(1) processes
PEGs written using the original syntax described by Ford while
leg(1) processes PEGs written using slightly different syntax and
conventions that are intended to make it an attractive replacement
for parsers built with lex(1) and yacc(1). Unlike lex(1) and
yacc(1), peg(1) and leg(1) support unlimited backtracking, provide
ordered choice as a means for disambiguation, and can combine
scanning (lexical analysis) and parsing (syntactic analysis) into a
single activity.