GPM The Gardens Point Modula (GPM) compiler family began as a project to make the language Modula-2 available in a consistent implementation on contemporary machines. It has become a flexible platform for research in compiler technology and associated areas. The compiler front-ends are based on the creation of an abstract syntax tree representation of the compilation unit, and all imported objects. This technology is fast but rather memory hungry. You can expect compilation speeds of about 36000 lines per minute on a slow 486 machine. The compiler back-ends, the code generators, read an intermediate representation called DCode, which is similar in general form to the U-Code representation. U-Code and DCode are instruction sets for abstract stack machines, and are implemented by a "shadow stack" automaton within the compiler back-end, which transforms the codes into the native instructions of the target machine.

Current Version:   ?? License Type:   ??

Home Site: http://www.plasrc.qut.edu.au/GPM/ Source Code Availability:   Yes Available Binary Packages: Debian Package:   No RedHat RPM Package:   No Other Packages:   Yes, see Home Site for downloading locations Targeted Platforms: Itel i386/i486 (under SVR4, Linux, DJGPP, Windows-NT and OS/2), Sun SPARC under Solaris, MIPS R3000 under Ultrix, Digital's Alpha-AXP under OSF/1 and most recently for IBM's RS/6000 under AIX. There is also an MS-DOS version based on interpreted DCode available. Software/Hardware Requirements: None

Other Links: None Mailing Lists/USENET News Groups: See Home Site for mailing list information User Comments: None See A Screen Shot? (Not Yet)

  SAL Home   |   Programming   |   Languages & Compilers