Recursive-Descent parser generators for C
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.
- Sources inherited from project openSUSE:Backports:SLE-15-SP5
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Leap:15.5:Update/peg && cd $_
- Create Badge
Source Files
Filename | Size | Changed |
---|---|---|
peg-0.1.18.tar.gz | 0000057776 56.4 KB | |
peg.changes | 0000000820 820 Bytes | |
peg.spec | 0000002418 2.36 KB |
Latest Revision
Automatically create request by update submitter. This is going to update package to openSUSE:Backports:SLE-15-SP5 from openSUSE:Factory. Please review this change and decline it if Leap do not need it.
Comments 0