PyBison is a sophisticated yet easy-to-use parser creation toolkit for Python that interfaces directly to Bison (yacc)-based parsers. It provides full LALR(1) grammar support, allowing for simple parsing tasks through to writing compilers for high-level languages. Parser code is automatically generated from rules within user-created Parser classes (written in Python), and then, compiled, yacc'ed and linked into a shared library, which is loaded into the running process. All this happens automatically. When the parser runs, it connects directly with the yyparse() routine, and takes event callbacks upon parse targets being reached.
RSP is a retargetable language for writing portable Web applications. Web applications can be written once in RSP and then compiled, using the RSP compiler, to either ASP, JSP or PHP. The RSP language is syntactically similar to Java/JSP. It is strongly typed and pseudo object orientated. Its standard library contains functions and objects for common Web programming tasks and database abstraction.
Vertica Smile is an expressive programming language combining the low level machine access and portability of assembler with the readablity of Brainfuck. The Vertica Smile language supports soft tokenization and token redefinition. Assembly, Brainfuck, F*ckf*ck, and Ook! code can be inserted inline as desired. The compiler generates small, fast statically linked executables with small memory footprints.
Real Man's Compiler Collection is a collection of compilers for people that feel like they have become too reliant helpful error messages that point you directly at the problems in your code. It simply outputs a succinct "Yes" or "No" indicating whether your program compiled successfully, without bothering you with all the nitpicky details of what's wrong with your code.
Oink is a collaboration of backends for the Elsa C and C++ frontend. It aims to be industrial-strength for immediate utility in finding bugs, extensible for ease in adding backends, and composable for ease in combining existing ones. It computes expression-level and type-level data flow, and statement-level intra-procedural control flow (by delegating to Elsa). It's easy to get started by using the two demo backends that print graphs of these flows. It also comes with a client of the data flow analysis that does type qualifier inference: Cqual++, a C/C++ frontend for Cqual. Whole-program analyses may be attempted using the linker imitator.
A parsing toolkit that supports both top-down (LL(1) and Simple Precedence) and bottom-up parsing (LR(0), SLR(1), LR(1) and LALR(1)). The toolkit also supports generating Java parsers for all the bottom-up parsing methods, based on a CUP definition (similar to Yacc and CUP, but not restricted to LALR parsers only).