<feed xmlns='http://www.w3.org/2005/Atom'>
<title>pkgsrc/textproc/PEGTL, branch trunk</title>
<subtitle>[no description]</subtitle>
<id>https://git.osdyson.ru/mirror/pkgsrc/atom?h=trunk</id>
<link rel='self' href='https://git.osdyson.ru/mirror/pkgsrc/atom?h=trunk'/>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/'/>
<updated>2021-10-26T11:21:28Z</updated>
<entry>
<title>textproc: Replace RMD160 checksums with BLAKE2s checksums</title>
<updated>2021-10-26T11:21:28Z</updated>
<author>
<name>nia</name>
<email>nia@pkgsrc.org</email>
</author>
<published>2021-10-26T11:21:28Z</published>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/commit/?id=61660834b0a69774e10438023a12761304770654'/>
<id>urn:sha1:61660834b0a69774e10438023a12761304770654</id>
<content type='text'>
All checksums have been double-checked against existing RMD160 and
SHA512 hashes

Unfetchable distfiles (fetched conditionally?):
./textproc/convertlit/distinfo clit18src.zip</content>
</entry>
<entry>
<title>textproc: Remove SHA1 hashes for distfiles</title>
<updated>2021-10-07T15:00:34Z</updated>
<author>
<name>nia</name>
<email>nia@pkgsrc.org</email>
</author>
<published>2021-10-07T15:00:34Z</published>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/commit/?id=352521ac2333360e42a855bb2c4e69c59c789c96'/>
<id>urn:sha1:352521ac2333360e42a855bb2c4e69c59c789c96</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Add PEGTL 2.8.3</title>
<updated>2021-05-04T14:19:51Z</updated>
<author>
<name>prlw1</name>
<email>prlw1@pkgsrc.org</email>
</author>
<published>2021-05-04T14:19:51Z</published>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/commit/?id=9b513c86b3b32d8e8ed7d13009875c5adf711f28'/>
<id>urn:sha1:9b513c86b3b32d8e8ed7d13009875c5adf711f28</id>
<content type='text'>
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.</content>
</entry>
</feed>
