TXR is a new data munging language. TXR's special pattern language provides template-based matching of entire documents or large sections of documents. It also contains a language for functional and imperative programming. It is written in C and takes the form of a utility that is portable to Unix-like platforms and Windows.
CL-PPCRE is a portable regular expression library for Common Lisp. It is compatible with Perl, and it's fast, portable (strictly ANSI-compliant), and thread-safe. It comes with convenient features like a SPLIT function, a couple of DO-like loop constructs, and a regex-based APROPOS feature similar to the one found in Emacs. In addition to specifying regular expressions as strings like in Perl, you can also use S-expressions which are more Lisp-y.
The Regex Coach is a graphical application for Linux and Windows which can be used to experiment with (Perl-compatible) regular expressions interactively. It shows whether a regular expression matches a particular target string, and can also show which parts of the target string correspond to captured register groups or to arbitrary parts of the regular expression. It can "walk" through the target string one match at a time and simulate Perl's split and s/// (substitution) operators. It tries to describe the regular expression in plain English. It can show a graphical representation of the regular expression's parse tree. It can single-step through the matching process as performed by the regex engine. Everything happens in "real time" (i.e., as soon as you make a change somewhere in the application all other parts are instantly updated).
CL-INTERPOL is a library for Common Lisp which modifies the reader so that you can have interpolation within strings, similar to Perl or Unix Shell scripts. It also provides various ways to insert arbitrary characters into literal strings even if your editor/IDE doesn't support them.
BMDFM allows one to run an application in parallel on shared memory multiprocessor (SMP) systems. BMDFM automatically identifies and executes all parallelism of unparallelized programs due to the static and mainly dynamic scheduling of the data flow instruction sequences derived from the formerly sequential program. BMDFM's dynamic scheduling subsystem performs an efficient SMP emulation of Tagged-Token DFM to provide the transparent dataflow semantics for the applications. No directives for parallel execution are required. No highly knowledgeable parallel programmers are required.