Wildcard Match provides an enhanced fnmatch, glob, and pathlib library in order
to provide file matching and globbing that more closely follows the features
found in Bash. In some ways these libraries are similar to Python's builtin
libraries as they provide a similar interface to match, filter, and glob the
file system. But they also include a number of features found in Bash's
globbing such as backslash escaping, brace expansion, extended glob pattern
groups, etc. They also add a number of new useful functions as well, such as
globmatch which functions like fnmatch, but for paths.
UTF8-CPP: UTF-8 with C++ in a Portable Way
Many C++ developers miss an easy and portable way of handling Unicode
encoded strings. The original C++ Standard (known as C++98 or C++03) is
Unicode agnostic. C++11 provides some support for Unicode on core
language and library level: u8, u, and U character and string literals,
char16_t and char32_t character types, u16string and u32string library
classes, and codecvt support for conversions between Unicode encoding
forms. In the meantime, developers use third party libraries like ICU,
OS specific capabilities, or simply roll out their own solutions.
In order to easily handle UTF-8 encoded Unicode strings, I came up with
a small generic library. For anybody used to work with STL algorithms
and iterators, it should be easy and natural to use. The code is freely
available for any purpose - check out the license at the beginning of
the utf8.h file. If you run into bugs or performance issues, please let
me know and I'll do my best to address them.
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.
Parsimonious aims to be the fastest arbitrary-lookahead parser written in pure
Python-and the most usable. It's based on parsing expression grammars (PEGs),
which means you feed it a simplified sort of EBNF notation. Parsimonious was
designed to undergird a MediaWiki parser that wouldn't take 5 seconds or a GB
of RAM to do one page, but it's applicable to all sorts of languages
inih (INI Not Invented Here) is a simple .INI file parser written in C. It's
only a couple of pages of code, and it was designed to be small and simple,
so it's good for embedded systems. It's also more or less compatible with
Python's ConfigParser style of .INI files, including RFC 822-style multi-line
syntax and name: value entries.
