Minnow is a concurrent programming language with a Ruby-like syntax. It compiles to an executable and uses a companion library to allow fully-rebalanced microthreads. Minnow gains a lot of strength from its actor model, which uses message passing, as opposed to threads and locking, as its concurrency model. Taking a cue from Erlang, actor creation and message passing is extremely lightweight (often on the order of a few nanoseconds). The language has a built-in foreign function interface that allows developers to leverage existing C-based libraries in a simple SWIG-like manner. Minnow's object model is based on "melding" features together to form objects.
Brace is a dialect of C that looks like Python. It has coroutines, hygenic macros, header generation, and libraries with graphics and sound. It is meant to be good for beginners, kids, and experts. Brace is translated to C, then compiled, with #! support and cached executables. It is fairly portable, and runs on GNU/Linux, Unix, and Windows with MinGW. It should also run on Mac OS X. It comes with a lot of demo programs, many with animated graphics.
MBase is a .NET-oriented meta-programming framework. It is designed for rapid development and high quality implementation of custom programming language compilers, but can also serve as a robust and flexible embeddable scripting engine. Applications are not limited to .NET platform, since MBase can be used to implement compilers targeting other platforms - JVM, native assembly, C, etc.
autober is a language for generating BER decoders. It's different from an ASN.1 compiler in that it's much simpler and it only deals with BER-encoded messages. It is intended for smart card and RFID applications where much of the data stored on these devices is, in-fact, BER-encoded TLV data. The language is designed to be very similar to the template definitions found in the specifications for smart card and RFID applications.
The IEC 61131-3 Structured Text to XML Compiler parses an IEC Structured Text source and generates an XML representation of the syntax tree of the source. Names defined in the IEC 61131-3 grammar are used as tag names, though underscore characters in the names of the non-terminal symbols are replaced with a minus sign. The result then can be further processed with the YML toolchain or with an XSLT stylesheet. The compiler is compatible with the 61131-3 ST standard as used in the Beremiz project, as well as with the dialect of EPAS 4.
foma is a compiler, programming language, and C library for constructing finite-state automata and transducers for various uses. It has specific support for many natural language processing applications such as producing morphological analyzers. Although NLP applications are probably the main use of foma, it is sufficiently generic to use for a large number of purposes. It comes with an xfst-compatible interface and regular expression language. The library contains efficient implementations of all classical automata/transducer algorithms: determinization, minimization, epsilon-removal, composition, and boolean operations. More advanced construction methods are also available: context restriction, quotients, first-order regular logic, transducers from replacement rules, etc.