494 projects tagged "Compilers"
Updated 15 Jul 2003
XPCE/SWI-Prolog
| Pop | 68.63 |
|---|---|
| Vit | 3.18 |
SWI-Prolog is an implementation of the Prolog language which aims to provide a free, user-friendly, fast, and scalable platform for learning Prolog, for doing research in logic programming, and for application development. With its XPCE graphics library, it provides a development environment for Prolog and portable (Unix/X11, Windows, and Mac OS X) graphics to applications. It features a very fast compiler, compliance to ISO and many de-facto standards, scalability, modules, garbage collection (even for atoms), fast two-way C and C++ interfaces, embeddability, last-call optimization, and portability (ANSI-C, 32 and 64-bit platforms).
Updated 28 Jan 2004
tavrasm
| Pop | 39.55 |
|---|---|
| Vit | 4.44 |
tavrasm is an assembler for the Atmel AVR series of microcontrollers. It compiles code written for Atmels AVR DOS assembler. Other features include macros in macros, 'C' escape characters in char/string literals.
Updated 30 Jan 2001
tdasm
| Pop | 22.27 |
|---|---|
| Vit | 1.00 |
The Table Driven Assembler (TDASM) is a portable cross assembler for any kind of assembly language. It should be possible to use it as a compiler to any target microprocessor using a table that defines the compilation process. The development of the project has been terminated. Anyone who would like to continue with development is welcomed, but there is only czech documentation available.
Updated 30 Jan 2001
Tesla
| Pop | 22.85 |
|---|---|
| Vit | 1.00 |
Tesla is the first TOM compiler written in TOM, and the first compiler to add blocks (a.k.a. closures) to TOM. Currently undergoing early testing, Tesla can be bootstrapped on a machine without prior TOM support.
Updated 15 Jun 2011
The Glasgow Haskell Compiler
| Pop | 188.96 |
|---|---|
| Vit | 11.64 |
The Glasgow Haskell Compiler is a robust, fully-featured, optimising compiler for the functional programming language Haskell. GHC compiles Haskell to either native code or C. It implements numerous experimental language extensions to Haskell for example concurrency, a foreign language interface, several type-system extensions, exceptions, and so on. GHC comes with a generational garbage collector, a space and time profiler, and a comprehensive set of libraries.
Updated 19 Jan 2002
The Harbour Project
| Pop | 74.38 |
|---|---|
| Vit | 3.31 |
Harbour is a free, cross-platform compiler for the Xbase language. It is designed to be as compatible with CA-Clipper as humanly possible. Harbour ships with full source and makefiles, and combined with one of many C compilers will create executables which run natively on the following platforms: Linux, FreeBSD, DOS, Windows 3.x/9x/NT/W2000, and OS/2.
Updated 16 Feb 2002
The Kawa Scheme System
| Pop | 63.48 |
|---|---|
| Vit | 2.09 |
The Kawa Scheme System is a full Scheme implementation, completely written in Java. Scheme functions and files are automatically compiled into Java byte-codes. Kawa does some optimizations, and the compiled code runs at a reasonable speed. It provides the usual read-eval-print loop, as well as batch modes. The Kawa compilation framework is also useful for implementing other languages on top of JVM. There is active development of XQuery (the XML query language), and less active development of Emacs Lisp, Common Lisp, and EcmaScript.
Updated 30 Jan 2001
theosim
| Pop | 17.03 |
|---|---|
| Vit | 1.00 |
theosim is a simulation and compilation package of several languages which are of theoretical relevance only (PASCALLI, PASCALLINO and RAM).
Updated 17 Nov 2008
TinyCOBOL
| Pop | 125.35 |
|---|---|
| Vit | 8.59 |
TinyCOBOL is an effort to bring a free COBOL compiler to Linux. It generates GNU assembler for the i386 Linux platform. A executable binary is then created using the GNU assembler and linker. The project is approaching the first beta release with many statements already implemented.
Updated 30 Jan 2001
TOM
| Pop | 24.25 |
|---|---|
| Vit | 1.75 |
TOM is a compiled object-oriented programming language that advocates unplanned reuse of code. To this effect, in TOM a class is defined by its main definition plus any extensions; an extension can add methods, variables, and superclasses to a class, while the class' source is not needed and does not need recompilation, nor is recompilation required for any client code or subclasses. Extensions can even be loaded at run time.
