The Parsing Expression Grammar Template Library (PEGTL) is a C++0x library for creating parsers according to a Parsing Expression Grammar (PEG). Grammars are embedded as regular C++ code, created with template programming (not template meta programming). These hierarchies naturally correspond to the inductive definition of PEGs. The library extends on the subject of PEGs with new expression types, actions that can be attached to grammar rules, and mechanisms to ensure helpful diagnostics in case of parsing errors. PEGs are superficially similar to Context-Free Grammars (CFGs).
Memview is a realtime visualization program which shows the memory state of another running program as a graphical image. Memory addresses correspond to pixels in the image, and as memory is accessed, the display will animate to show which parts of the address space are currently being referenced by the program.
Turn Watcher is a tool based on Dungeons & Dragons rules. It is used to track the initiative of your players and monsters. It includes an option to roll initiative on every round, roll will, listen, and spot, and it has a status column that shows you the current status of your players. When you enter a player or monster, you also enter all of its modifiers, so the computer can take care of rolling all the dice for you. Still want to roll initiative? You can simply order the characters with the Move Up and Move Down options.
Miscellaneous Container Templates is a C++ library that provides a collection of various STL-like containers with specific properties. It currently contains six closely related containers: closed_hash_set, closed_hash_map, linked_hash_*, and forward_hash_*. The first two are very similar to TR1 unordered_set and unordered_map; the linked ones provide additional functionality, while forward hash tables are more performant than linked, but have a restricted interface.
lrc (The Linux Resource Compiler) is a system for packing many files into a single file for installation and use in a program as its resources (such as the graphics and sounds used by a game). It consists of a command-line tool, called lrc, for compiling the resources and a library, called liblrc, to extract the resources from a file generated by the compiler.
chilon::parser provides an extended PEG-like language using C++0x template meta-programming. This PEG-based language has been extended to support AST building features directly embedded into the type system. chilon::parser uses the input PEG to create the AST type at compile time using tuples, vectors, variants, custom classes, ranges, and primitive types. The AST is populated by parsers generated from the same type description at run-time.
The Mirror C++ reflection library provides both compile-time and run-time meta-data describing common C++ program constructs like namespaces, types, enumerations, classes, their base classes and member variables, constructors, etc. and provides generic interfaces for their introspection. It also provides several high-level utilities based on the reflected meta-data like a factory generator, which generates, at compile-time, implementations of object factories which can create instances of arbitrary 'reflectable' type.
nyu is a combination of modern academic approaches to parsing formal grammars from PEGs and expression grammars that represents the new state of the art in parser generators. nyu grammars are written in a powerful language based on PEGs (parsing expression grammars) but with modifications to allow both the AST and the parser to be specified intuitively in a single grammar. nyu outputs parsers that take advantage of the chilon::parser meta-programming library for C++. The generated parsers are almost as concise and readable as the input grammars, yet perform as well as hand-written C code. nyu ASTs are built using tuples, variant types, and lists, and allow self referential parsers and AST nodes to be manipulated. Advanced features such as hashed containers and grammar inheritance are also possible and well tested. nyu is currently powerful enough to deal with complex grammars and bootstraps its own parser.