Red language is a native-code compiled functional, imperative, symbolic, and homoiconic programming language that re-uses most of REBOL's syntax and semantics. Both static and JIT compilation support are planned. A strong emphasis is made on concurrency and both task and data parallelism support using an actor-like abstraction and parallel collections (Scala-like). The target range of usage spreads from low-level system programming (thanks to the built-in Red/System C-level DSL) and embedded systems, up to high-level scripting, with an optional REPL console.
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.
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.
The Objeck computer language is an object-oriented computing language with functional features that has ties with Java, C#, and Pascal. In this language, all data types are treated as objects. The language consists of a compiler and VM with an accompanying memory management and JIT compiler.
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.
Rhope is a dynamically typed dataflow programming language that also borrows some ideas from other paradigms. Unlike mainstream programming languages, statements are not necessarily executed in the order they are written, but instead based on their dependencies. Statements that do not share dependencies run in parallel. Most operations have value semantics (i.e. modifying an object makes a copy rather than changing the original) making this parallelism safe. For managing global state, Rhope has a transaction mechanism.
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.
X# (pronounced X-sharp) is an XML-oriented programming language designed to quickly create Web applications and services. Everything is represented as an XML tree, and instead of using functions to manipulate information or perform actions, all possible operations are done by adding, removing, or changing nodes from this tree. Since there are no functions to learn and everything is done intuitively, even inexperienced developers can create complex Web applications and services quickly.