./textproc/PEGTL, C++ header-only parser combinator library

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: CURRENT, Version: 2.8.3, Package name: PEGTL-2.8.3, Maintainer: prlw1

The Parsing Expression Grammar Template Library (PEGTL) is a
zero-dependency C++ header-only parser combinator library for
creating parsers according to a Parsing Expression Grammar (PEG).

Grammars are written as regular C++ code, created with template
programming (not template meta programming), i.e. nested template
instantiations that naturally correspond to the inductive definition
of PEGs (and other parser-combinator approaches).

A comprehensive set of parser rules that can be combined and extended
by the user is included, as are mechanisms for debugging grammars,
and for attaching user-defined actions to grammar rules.

Master sites:

Filesize: 196.808 KB

Version history: (Expand)

CVS history: (Expand)


   2024-08-25 08:19:21 by Thomas Klausner | Files touched by this commit (575) 
Log message:
*: replace CMAKE_ARGS with CMAKE_CONFIGURE_ARGS
   2021-10-26 13:23:42 by Nia Alarie | Files touched by this commit (1161) 
Log message:
textproc: Replace RMD160 checksums with BLAKE2s checksums

All checksums have been double-checked against existing RMD160 and
SHA512 hashes

Unfetchable distfiles (fetched conditionally?):
./textproc/convertlit/distinfo clit18src.zip
   2021-10-07 17:02:49 by Nia Alarie | Files touched by this commit (1162) 
Log message:
textproc: Remove SHA1 hashes for distfiles
   2021-05-04 16:19:51 by Patrick Welche | Files touched by this commit (5) 
Log message:
Add PEGTL 2.8.3

The Parsing Expression Grammar Template Library (PEGTL) is a
zero-dependency C++ header-only parser combinator library for
creating parsers according to a Parsing Expression Grammar (PEG).

Grammars are written as regular C++ code, created with template
programming (not template meta programming), i.e. nested template
instantiations that naturally correspond to the inductive definition
of PEGs (and other parser-combinator approaches).

A comprehensive set of parser rules that can be combined and extended
by the user is included, as are mechanisms for debugging grammars,
and for attaching user-defined actions to grammar rules.