LogoopenSUSE Build Service > Projects
Sign Up | Log In

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.

Source Files

Filename Size Changed Actions
peg-0.1.13.tar.gz 54.1 KB Download File
peg.spec 1.73 KB Download File

Comments for home:zhonghuaren (0)

Login required, please login or signup in order to comment