The Abacus Formula Compiler (AFC) compiles computations defined in spreadsheet files directly to Java byte code. Users can thus customize an application using Excel or OpenOffice Calc. AFC compiles against your own Java interfaces to obtain input values and compute output values (it essentially generates strategy implementations for you), and supports internal computations with either double or BigDecimal (for financial applications).
Absimpa is a Java class library that provides a recursive decent parser. It is an experiment in abstraction and Java generics. It tries to include only the essentials of what makes out a parser and to leave out, or rather leave free for specification, what is not relevant for the parsing process.
Amber for Parrot is an object-oriented scripting language for the Parrot virtual machine. It combines the traditional advantages of scripting languages with support for software correctness and large-scale software engineering. Amber for Parrot has syntax and semantics somewhere between those of Eiffel and Ruby.
Aseba is an event-based architecture for distributed control of mobile robots. It targets integrated multi-processor robots or groups of single-processor units, real or simulated. The core of aseba is a lightweight virtual machine tiny enough to run even on microcontrollers. Robots are programmed in a user-friendly scripting language using a cozy integrated development environment.
Aubit 4GL compiler is a programming language based on (and compatible with) Informix-4GL. It provides an easy way to generate screen/form based programs, since statements for handling Windows, Forms, Menus, SQL, and similar are built-in. With support for SQL statements forming an intrinsic part of the language, it's especially suitable for developing database-oriented applications. Database connectivity is provided for PostgreSQL, MySQL, Informix, and others via ODBC. It supports both ncurses (console mode) and GTK+ (GUI mode) output.
AutoAbacus is a powerful equation solving library that finds solutions to equation sets. Equations are passed to AutoAbacus as text, and the program attempts to find a solution that satisfies all constraints. The equations can be linear or polynomial, and can include arbitrary functions. By profiling the types of equations in the system and their dependencies on each other, AutoAbacus uses appropriate solution methods to solve individual subsets of equations. Applications range from use in a business rules engine to solving engineering equation systems.