<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>

<channel>
	<title>A Catalog of Research Compiler Infrastructures and Tools</title>
	<atom:link href="http://compiler-tools.org/feed/" rel="self" type="application/rss+xml" />
	<link>http://compiler-tools.org</link>
	<description>Links to and information about research compiler infrastructures, curated by Will Benton</description>
	<pubDate>Wed, 12 Mar 2008 16:42:02 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.2</generator>
	<language>en</language>
			<item>
		<title>Wala</title>
		<link>http://compiler-tools.org/archives/2008/03/12/main-page-walawiki/</link>
		<comments>http://compiler-tools.org/archives/2008/03/12/main-page-walawiki/#comments</comments>
		<pubDate>Wed, 12 Mar 2008 16:41:39 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Java/JVM]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2008/03/12/main-page-walawiki/</guid>
		<description><![CDATA[WALA is a framework for static analysis of Java bytecode.  From the web page:

The T. J. Watson Libraries for Analysis (WALA) provide static analysis capabilities for Java bytecode and related languages. The system is licensed under the Eclipse Public License, which has been approved by the OSI (Open Source Initiative) as a fully certified [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2008/03/12/main-page-walawiki/feed/</wfw:commentRss>
		</item>
		<item>
		<title>JastAdd
        —
        JastAdd</title>
		<link>http://compiler-tools.org/archives/2008/03/12/jastadd-%e2%80%94-jastadd/</link>
		<comments>http://compiler-tools.org/archives/2008/03/12/jastadd-%e2%80%94-jastadd/#comments</comments>
		<pubDate>Wed, 12 Mar 2008 16:21:53 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[Tools:  compiler-compilers]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2008/03/12/jastadd-%e2%80%94-jastadd/</guid>
		<description><![CDATA[JastAdd is a compiler-compiler system based on attribute grammars.  It is designed to enable adding new features to a compiler by adding modules to a specification.  From the web site:

JastAdd is an open source Java-based compiler compiler system. It is designed to support high-level extensible implementation of compilers and related tools like analyzers, [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2008/03/12/jastadd-%e2%80%94-jastadd/feed/</wfw:commentRss>
		</item>
		<item>
		<title>POPL Coq tutorial</title>
		<link>http://compiler-tools.org/archives/2008/01/07/popl-coq-tutorial/</link>
		<comments>http://compiler-tools.org/archives/2008/01/07/popl-coq-tutorial/#comments</comments>
		<pubDate>Mon, 07 Jan 2008 22:53:49 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Theorem provers]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2008/01/07/popl-coq-tutorial/</guid>
		<description><![CDATA[The Penn PL Club is presenting a Coq tutorial at POPL 2008.  It covers Coq basics, the simply-typed lambda calculus, and System F&#60;:.  If you can&#8217;t attend, you can download the code, which is intended to be self-contained and looks quite clear.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2008/01/07/popl-coq-tutorial/feed/</wfw:commentRss>
		</item>
		<item>
		<title>PLT Redex</title>
		<link>http://compiler-tools.org/archives/2007/12/23/plt-redex/</link>
		<comments>http://compiler-tools.org/archives/2007/12/23/plt-redex/#comments</comments>
		<pubDate>Sun, 23 Dec 2007 18:35:45 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Scheme]]></category>

		<category><![CDATA[Semantic assistants]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2007/12/23/plt-redex/</guid>
		<description><![CDATA[PLT Redex is a domain-specific language designed for specifying and debugging operational semantics. Write down a grammar and the reduction rules, and PLT Redex produces a stepper. It also provides support for building a test suites from the specification of a semantics.

]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2007/12/23/plt-redex/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Ott</title>
		<link>http://compiler-tools.org/archives/2007/12/23/ott/</link>
		<comments>http://compiler-tools.org/archives/2007/12/23/ott/#comments</comments>
		<pubDate>Sun, 23 Dec 2007 18:33:06 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Semantic assistants]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2007/12/23/ott/</guid>
		<description><![CDATA[Ott is a tool for writing definitions of programming languages and calculi. It takes as input a definition of a language syntax and semantics, in a concise and readable ASCII notation that is close to what one would write in informal mathematics. It generates LaTeX to build a typeset version of the definition, and Coq, [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2007/12/23/ott/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Twelf</title>
		<link>http://compiler-tools.org/archives/2007/12/22/twelf/</link>
		<comments>http://compiler-tools.org/archives/2007/12/22/twelf/#comments</comments>
		<pubDate>Sun, 23 Dec 2007 04:28:00 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Theorem provers]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2007/12/22/twelf/</guid>
		<description><![CDATA[Twelf is a language based on the LF logical framework and can be used for specifying the metatheory of logics and programming languages.  It includes a theorem prover and a theorem checker.
Here are some resources on Twelf:  Andrew Appel&#8217;s tutorial, John Boyland&#8217;s tutorial, and Mechanizing Metatheory in a Logical Framework, by Robert Harper [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2007/12/22/twelf/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Banshee</title>
		<link>http://compiler-tools.org/archives/2007/12/22/banshee/</link>
		<comments>http://compiler-tools.org/archives/2007/12/22/banshee/#comments</comments>
		<pubDate>Sun, 23 Dec 2007 04:20:43 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Analysis frameworks]]></category>

		<category><![CDATA[C and/or C++]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2007/12/22/banshee/</guid>
		<description><![CDATA[BANSHEE is a toolkit for specifying program analyses as set or term constraint problems.  From the web page:
BANSHEE is a toolkit that simplfies the task of building constraint-based program analyses. Program analyses are widely used in compilers and software engineering tools for discovering or verifying specific properties of software systems, such as type safety [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2007/12/22/banshee/feed/</wfw:commentRss>
		</item>
		<item>
		<title>bddbddb</title>
		<link>http://compiler-tools.org/archives/2007/12/22/bddbddb/</link>
		<comments>http://compiler-tools.org/archives/2007/12/22/bddbddb/#comments</comments>
		<pubDate>Sun, 23 Dec 2007 04:18:24 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Analysis frameworks]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2007/12/22/bddbddb/</guid>
		<description><![CDATA[bddbddb is a BDD-based implementation of Datalog; it is ideal for implementing scalable program analyses.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2007/12/22/bddbddb/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Pin</title>
		<link>http://compiler-tools.org/archives/2007/12/22/pin/</link>
		<comments>http://compiler-tools.org/archives/2007/12/22/pin/#comments</comments>
		<pubDate>Sun, 23 Dec 2007 00:07:51 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Tools:  binary rewriters and editors]]></category>

		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2007/12/22/pin/</guid>
		<description><![CDATA[Pin is a dynamic instrumentation tool.  From the website:
Pin is a tool for the dynamic instrumentation of programs. It supports Linux binary executables for Intel (R) Xscale (R), IA-32, IA-32E (64 bit x86), and Itanium (R) processors. It also allow instrumentation of Windows programs on IA-32 and Intel (R) 64 processors
Pin was designed to [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2007/12/22/pin/feed/</wfw:commentRss>
		</item>
		<item>
		<title>AVS C# parser</title>
		<link>http://compiler-tools.org/archives/2005/03/29/avs-c-parser/</link>
		<comments>http://compiler-tools.org/archives/2005/03/29/avs-c-parser/#comments</comments>
		<pubDate>Tue, 29 Mar 2005 15:25:48 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C-sharp]]></category>

		<guid isPermaLink="false"></guid>
		<description><![CDATA[Thanks to Alex Sedow for a link to AVS Software, which produces a pair of C# parsers for compilers and refactoring tools.]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2005/03/29/avs-c-parser/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Site updates</title>
		<link>http://compiler-tools.org/archives/2004/10/27/site-updates/</link>
		<comments>http://compiler-tools.org/archives/2004/10/27/site-updates/#comments</comments>
		<pubDate>Wed, 27 Oct 2004 17:36:29 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Site news]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/10/27/site-updates/</guid>
		<description><![CDATA[I moved the site to a new domain about a month ago; you can now access this site at compiler-tools.org.  The old address should still work indefinitely, but please do upgrade your bookmarks.  Unfortunately, I managed to break the link-tracking script when updating the site; it should now be fixed and outbound links [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/10/27/site-updates/feed/</wfw:commentRss>
		</item>
		<item>
		<title>PearColator</title>
		<link>http://compiler-tools.org/archives/2004/10/27/pearcolator/</link>
		<comments>http://compiler-tools.org/archives/2004/10/27/pearcolator/#comments</comments>
		<pubDate>Wed, 27 Oct 2004 17:24:35 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[PPC]]></category>

		<category><![CDATA[Tools:  binary rewriters and editors]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/10/27/pearcolator/</guid>
		<description><![CDATA[The APT group at Manchester have released PearColator, which is a dynamic binary translator based on the Jikes RVM and licensed under the IBM CPL.  PearColator converts PPC binaries to the Jikes IR, performs optimizations, and recompiles them for the host architecture.  As a result, all of the optimizations supported by Jikes are [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/10/27/pearcolator/feed/</wfw:commentRss>
		</item>
		<item>
		<title>CodeSurfer</title>
		<link>http://compiler-tools.org/archives/2004/10/05/codesurfer/</link>
		<comments>http://compiler-tools.org/archives/2004/10/05/codesurfer/#comments</comments>
		<pubDate>Wed, 06 Oct 2004 03:07:04 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/10/05/codesurfer/</guid>
		<description><![CDATA[Mark Zarins of GrammaTech writes about the CodeSurfer tool, which is freely available for academic researchers:CodeSurfer is an advanced source-code analysis platform for C/C++ that understands pointers, indirect function calls, and whole-program effects....  Operations that highlight paths between nodes in the dependence graph (chops) show ways in which the program points are interdependent (or independent).CodeSurfer&#8217;s scripting language, which provides access to the dependence graph program representation, can be used to build batch program-analysis applications, or to integrate CodeSurfer with other tools.  The following program representations are calculated: Abstract Syntax Trees (ASTs) [with a pattern matching API] Preprocessor Expansions and Include Trees Points-To and Pointed-To-By Sets Control Flow Graphs (CFGs) Call Multi-Graphs [direct &#38; indirect] Def, Use, and Conditional-Kill Sets [per statement] Non-Local Def and Use Sets [per procedure] Control and Data Dependences (PDGs) [per statement] Transitive in/out data dependences [per procedure] More information about the programming API can be found here:http://www.grammatech.com/products/codesurfer/overview_prog.htmlMore information about the CodeSurfer Academic Program can be found here:http://www.grammatech.com/products/codesurfer/academic.htmlImportant notes: Under the academic program, use of CodeSurfer is limited to non-profit use within academic units only.]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/10/05/codesurfer/feed/</wfw:commentRss>
		</item>
		<item>
		<title>LaTTe: A Fast and Efficient Java VM Just-in-Time Compiler</title>
		<link>http://compiler-tools.org/archives/2004/08/25/latte-a-fast-and-efficient-java-vm-just-in-time-compiler/</link>
		<comments>http://compiler-tools.org/archives/2004/08/25/latte-a-fast-and-efficient-java-vm-just-in-time-compiler/#comments</comments>
		<pubDate>Wed, 25 Aug 2004 21:52:59 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Java/JVM]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/08/25/latte-a-fast-and-efficient-java-vm-just-in-time-compiler/</guid>
		<description><![CDATA[Thanks to Matt Allen for a link to LaTTe: A Fast and Efficient Java VM Just-in-Time Compiler from Seoul National University.  According to the website, LaTTe offers:


Fast and effective JIT translation with:

efficient register mapping and allocation (i.e., consistently
taking one or two seconds for SPECjvm98 which runs 40-70 seconds with
LaTTe)
traditional optimizations (e.g., common subexpression elimination
and [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/08/25/latte-a-fast-and-efficient-java-vm-just-in-time-compiler/feed/</wfw:commentRss>
		</item>
		<item>
		<title>ICD-C Compiler framework</title>
		<link>http://compiler-tools.org/archives/2004/06/17/icd-c-compiler-framework/</link>
		<comments>http://compiler-tools.org/archives/2004/06/17/icd-c-compiler-framework/#comments</comments>
		<pubDate>Thu, 17 Jun 2004 20:27:08 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Back-ends and portable IRs]]></category>

		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Tools:  IR translators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/06/17/icd-c-compiler-framework/</guid>
		<description><![CDATA[Thanks to J&#246;rg Eckart for a pointer to the ICD-C Compiler framework, which provides, among other things, a C99 parser, a high-level intermediate representation, control and data flow analyses, call graph analyses, and a framework for analyses spanning multiple compilation units.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/06/17/icd-c-compiler-framework/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Java Intermediate Language</title>
		<link>http://compiler-tools.org/archives/2004/06/02/java-intermediate-language/</link>
		<comments>http://compiler-tools.org/archives/2004/06/02/java-intermediate-language/#comments</comments>
		<pubDate>Wed, 02 Jun 2004 19:47:02 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Back-ends and portable IRs]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/06/02/java-intermediate-language/</guid>
		<description><![CDATA[The Java Intermediate Language is an XML-based intermediate representation for Java source code.  It appears to have been used most for visualization.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/06/02/java-intermediate-language/feed/</wfw:commentRss>
		</item>
		<item>
		<title>ACE CoSy</title>
		<link>http://compiler-tools.org/archives/2004/05/06/ace-cosy/</link>
		<comments>http://compiler-tools.org/archives/2004/05/06/ace-cosy/#comments</comments>
		<pubDate>Thu, 06 May 2004 23:03:54 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/05/06/ace-cosy/</guid>
		<description><![CDATA[Thanks to Joseph van Vlijmen for a pointer to ACE CoSy, a C and C++ compiler infrastructure for conventional, DSP, VLIW, and experimental processors and microcontrollers.  From the web page:


CoSy is the highly flexible, easy-targetable compiler development  system from ACE Associated Compiler Experts, which has been successfully  deployed by over 40 industrial customers [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/05/06/ace-cosy/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Polyglot extensible compiler framework</title>
		<link>http://compiler-tools.org/archives/2004/05/06/polyglot-extensible-compiler-framework/</link>
		<comments>http://compiler-tools.org/archives/2004/05/06/polyglot-extensible-compiler-framework/#comments</comments>
		<pubDate>Thu, 06 May 2004 22:55:57 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Java/JVM]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/05/06/polyglot-extensible-compiler-framework/</guid>
		<description><![CDATA[Polyglot is a framework that provides a front-end for the Java language and a means to develop extensions to Java.  It has been used to develop variants of Java that support static information flow control, parameterized types, and pattern matching.  It is also used by the source-to-bytecode compiler in the newest release of [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/05/06/polyglot-extensible-compiler-framework/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Free Pascal - Home Page</title>
		<link>http://compiler-tools.org/archives/2004/04/23/free-pascal-home-page/</link>
		<comments>http://compiler-tools.org/archives/2004/04/23/free-pascal-home-page/#comments</comments>
		<pubDate>Sat, 24 Apr 2004 03:52:21 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Pascal]]></category>

		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/23/free-pascal-home-page/</guid>
		<description><![CDATA[Thanks to Marco van de Voort for a pointer to Free Pascal.  Marco points out that the development version of Free Pascal supports a variety of dialects of Pascal, has a modular code generator and linker, and supports multiple backends.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/23/free-pascal-home-page/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Elkhound: A GLR Parser Generator</title>
		<link>http://compiler-tools.org/archives/2004/04/23/elkhound-a-glr-parser-generator/</link>
		<comments>http://compiler-tools.org/archives/2004/04/23/elkhound-a-glr-parser-generator/#comments</comments>
		<pubDate>Sat, 24 Apr 2004 03:44:46 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[OCaml]]></category>

		<category><![CDATA[Tools:  lexer, parser, etc. generators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/23/elkhound-a-glr-parser-generator/</guid>
		<description><![CDATA[Thanks to David Wagner for a pointer to Elkhound, which is a GLR (Generalized LR) parser generator.  It can generate parsers in C++ and OCaml, and includes Elsa, a grammar for C++.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/23/elkhound-a-glr-parser-generator/feed/</wfw:commentRss>
		</item>
		<item>
		<title>DMS Software Reengineering Toolkit</title>
		<link>http://compiler-tools.org/archives/2004/04/18/dms-software-reengineering-toolkit/</link>
		<comments>http://compiler-tools.org/archives/2004/04/18/dms-software-reengineering-toolkit/#comments</comments>
		<pubDate>Mon, 19 Apr 2004 02:31:49 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[C-sharp]]></category>

		<category><![CDATA[Fortran]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[Tools:  IR translators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/18/dms-software-reengineering-toolkit/</guid>
		<description><![CDATA[Thanks to Ira Baxter for a pointer to the DMS Software Reengineering Toolkit.  According to the web page,

The DMS Software Reengineering Toolkit is a set of tools for automating customized source program analysis, modification or translation or generation of software systems, containing arbitrary mixtures of languages (&#8221;domains&#8221;). The term &#8220;software&#8221; for DMS is very [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/18/dms-software-reengineering-toolkit/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Compiler Generator Coco/R</title>
		<link>http://compiler-tools.org/archives/2004/04/15/compiler-generator-cocor/</link>
		<comments>http://compiler-tools.org/archives/2004/04/15/compiler-generator-cocor/#comments</comments>
		<pubDate>Fri, 16 Apr 2004 03:20:25 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[C-sharp]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[Tools:  lexer, parser, etc. generators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/15/compiler-generator-cocor/</guid>
		<description><![CDATA[Thanks to Mykola Rabchevskiy for a pointer to Coco/R, a scanner/parser generator from the University of Linz.  It generates source for C# and Java; there are also (apparently unsupported) versions that generate code for Oberon, Pascal, Modula-2, C, C++, Delphi, and Unicon.  Coco/R generates recursive descent parsers and scanners from an attributed grammar [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/15/compiler-generator-cocor/feed/</wfw:commentRss>
		</item>
		<item>
		<title>iburg, A Tree Parser Generator</title>
		<link>http://compiler-tools.org/archives/2004/04/15/iburg-a-tree-parser-generator/</link>
		<comments>http://compiler-tools.org/archives/2004/04/15/iburg-a-tree-parser-generator/#comments</comments>
		<pubDate>Thu, 15 Apr 2004 18:47:13 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Tools:  code-generator generators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/15/iburg-a-tree-parser-generator/</guid>
		<description><![CDATA[iburg is most often used as a code-generator generator.  From the web page:

iburg is a program that generates fast tree parsers for cost-augmented tree grammars. iburg is useful for writing code generators and for teaching computer science compiler courses.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/15/iburg-a-tree-parser-generator/feed/</wfw:commentRss>
		</item>
		<item>
		<title>SableVM</title>
		<link>http://compiler-tools.org/archives/2004/04/15/sablevm/</link>
		<comments>http://compiler-tools.org/archives/2004/04/15/sablevm/#comments</comments>
		<pubDate>Thu, 15 Apr 2004 18:43:54 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Alpha]]></category>

		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[IA-64]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[PPC]]></category>

		<category><![CDATA[SPARC]]></category>

		<category><![CDATA[StrongARM]]></category>

		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/15/sablevm/</guid>
		<description><![CDATA[SableVM is a free/Free spec-compliant and extensible JVM.  It includes a JIT for PPC, SPARC and x86, but runs on several more architectures.  It supports several different interpreter dispatch models (switched, threaded, inlined) and has an efficient runtime system.  It is implemented in C with extensive use of M4 macros.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/15/sablevm/feed/</wfw:commentRss>
		</item>
		<item>
		<title>SableCC parser generator</title>
		<link>http://compiler-tools.org/archives/2004/04/15/sablecc-parser-generator/</link>
		<comments>http://compiler-tools.org/archives/2004/04/15/sablecc-parser-generator/#comments</comments>
		<pubDate>Thu, 15 Apr 2004 18:34:22 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[Tools:  lexer, parser, etc. generators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/15/sablecc-parser-generator/</guid>
		<description><![CDATA[The SableCC parser generator is a tool for compiler developers who use Java.  From the web page:

SableCC is an object-oriented framework that generates compilers (and  interpreters) in the Java programming language. This framework is based on  two fundamental design decisions. Firstly, the framework uses object-oriented  techniques to automatically build a strictly [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/15/sablecc-parser-generator/feed/</wfw:commentRss>
		</item>
		<item>
		<title>SPARK &#8212; a &#8220;little language framework&#8221; for Python</title>
		<link>http://compiler-tools.org/archives/2004/04/09/spark-a-little-language-framework-for-python/</link>
		<comments>http://compiler-tools.org/archives/2004/04/09/spark-a-little-language-framework-for-python/#comments</comments>
		<pubDate>Fri, 09 Apr 2004 19:34:07 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Python]]></category>

		<category><![CDATA[Tools:  VM/interpreter generators]]></category>

		<category><![CDATA[Tools:  lexer, parser, etc. generators]]></category>

		<category><![CDATA[-etc.-generators]]></category>

		<category><![CDATA[-parser]]></category>

		<category><![CDATA[Tools:--lexer]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/09/spark-a-little-language-framework-for-python/</guid>
		<description><![CDATA[SPARK is a &#8220;Scanning, Parsing, and Rewriting Kit,&#8221; enabling the construction of interpreters and compilers for &#8220;little&#8221; or domain-specific languages in Python.  It appears to be fairly widely used; the author has used it for &#8220;a compiler for Guide, compiling a subset of Java, an experimental type inferencer for Python, and probably a few [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/09/spark-a-little-language-framework-for-python/feed/</wfw:commentRss>
		</item>
		<item>
		<title>treecc</title>
		<link>http://compiler-tools.org/archives/2004/04/09/treecc/</link>
		<comments>http://compiler-tools.org/archives/2004/04/09/treecc/#comments</comments>
		<pubDate>Fri, 09 Apr 2004 19:17:55 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[C-sharp]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[Tools:  IR translators]]></category>

		<category><![CDATA[Tools:  lexer, parser, etc. generators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/09/treecc/</guid>
		<description><![CDATA[treecc is a tool for building programs that operate on trees (as such, it does not fit neatly into the two &#8220;Tools:&#8221; categories I have placed it in).  It will generate code for C, C++, C#, and Java, and is notable for its aspect-oriented approach to compiler construction.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/09/treecc/feed/</wfw:commentRss>
		</item>
		<item>
		<title>EDG C++, Java, and Fortran front-ends</title>
		<link>http://compiler-tools.org/archives/2004/04/09/edg-c-java-and-fortran-front-ends/</link>
		<comments>http://compiler-tools.org/archives/2004/04/09/edg-c-java-and-fortran-front-ends/#comments</comments>
		<pubDate>Fri, 09 Apr 2004 19:09:19 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Fortran]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/09/edg-c-java-and-fortran-front-ends/</guid>
		<description><![CDATA[The Edison Design Group makes a standards-compliant C++ front end, as well as Java and Fortran front-ends.  While their primary market is compiler and program transformation tool vendors, apparently they are willing to license these to university researchers on a case-by-case basis.  (per their FAQ.)
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/09/edg-c-java-and-fortran-front-ends/feed/</wfw:commentRss>
		</item>
		<item>
		<title>ERCO Java compiler</title>
		<link>http://compiler-tools.org/archives/2004/04/09/erco-java-compiler/</link>
		<comments>http://compiler-tools.org/archives/2004/04/09/erco-java-compiler/#comments</comments>
		<pubDate>Fri, 09 Apr 2004 19:01:04 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/09/erco-java-compiler/</guid>
		<description><![CDATA[ERCO is a Java-to-native compiler developed by the Laboratory for Software Technologies at ETH Z&#252;rich.  From the web site:

The ETH Research COmpiler (ERCO) is a research Java byte-code to  native compiler that is used in several projects in our group as for  teaching in advanced compiler classes.  We translate the Java [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/09/erco-java-compiler/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Machine SUIF</title>
		<link>http://compiler-tools.org/archives/2004/04/09/machine-suif/</link>
		<comments>http://compiler-tools.org/archives/2004/04/09/machine-suif/#comments</comments>
		<pubDate>Fri, 09 Apr 2004 18:47:55 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Alpha]]></category>

		<category><![CDATA[IA-64]]></category>

		<category><![CDATA[SUIF IR]]></category>

		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/09/machine-suif/</guid>
		<description><![CDATA[Machine SUIF is &#8220;a flexible, extensible, and usable infrastructure for constructing compiler back ends.&#8221;  Most notably, Machine SUIF provides a way to generate code for x86, IA-64, or Alpha from SUIF code, as well as &#8220;libraries for control- and data-flow analysis, and passes for register allocation, instruction scheduling, scalar optimization, and code layout.&#8221;  [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/09/machine-suif/feed/</wfw:commentRss>
		</item>
		<item>
		<title>SUIF</title>
		<link>http://compiler-tools.org/archives/2004/04/09/suif/</link>
		<comments>http://compiler-tools.org/archives/2004/04/09/suif/#comments</comments>
		<pubDate>Fri, 09 Apr 2004 18:39:26 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Fortran]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[MIPS]]></category>

		<category><![CDATA[SUIF IR]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/09/suif/</guid>
		<description><![CDATA[The venerable SUIF system is &#8220;a free infrastructure designed to support collaborative research in optimizing and parallelizing compilers.&#8221;  It is fairly straightforward to write your own passes on the SUIF IR in C++.  Frontends exist for C, C++, Fortran, and Java, and SUIF can interoperate with Zephyr; there are MIPS and C backends.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/09/suif/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Nemerle; a &#8220;hybrid&#8221; language for .NET CLR</title>
		<link>http://compiler-tools.org/archives/2004/04/06/nemerle-a-hybrid-language-for-net-clr/</link>
		<comments>http://compiler-tools.org/archives/2004/04/06/nemerle-a-hybrid-language-for-net-clr/#comments</comments>
		<pubDate>Tue, 06 Apr 2004 21:23:01 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Microsoft CLR]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/06/nemerle-a-hybrid-language-for-net-clr/</guid>
		<description><![CDATA[Thanks to Kamil Skalski for a pointer to Nemerle, a object-oriented language that supports functional and generative features.  Nemerle supports pattern matching and a rich macro facility.  The macro facility in particular would seem to make Nemerle a fine basis for those exploring language semantics or developing domain-specific languages.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/06/nemerle-a-hybrid-language-for-net-clr/feed/</wfw:commentRss>
		</item>
		<item>
		<title>ANTLR Parser Generator and Translator Generator Home Page</title>
		<link>http://compiler-tools.org/archives/2004/04/01/antlr-parser-generator-and-translator-generator-home-page/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/antlr-parser-generator-and-translator-generator-home-page/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 23:05:22 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[C-sharp]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[Tools:  lexer, parser, etc. generators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/antlr-parser-generator-and-translator-generator-home-page/</guid>
		<description><![CDATA[The ANTLR Parser Generator and Translator Generator is a well-regarded tool to aid in generating compiler frontends in Java, C# or C++.  From the web page:

ANother Tool for Language Recognition, (formerly PCCTS) is a language tool that provides a framework for constructing recognizers, compilers, and translators from grammatical descriptions containing Java, C#, or C++ [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/antlr-parser-generator-and-translator-generator-home-page/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Jakarta BCEL</title>
		<link>http://compiler-tools.org/archives/2004/04/01/jakarta-bcel/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/jakarta-bcel/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 22:59:41 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Java/JVM]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/jakarta-bcel/</guid>
		<description><![CDATA[The Byte Code Engineering Library (BCEL) is a Java library enabling creation, analysis, and modification of Java .class files.  According to its website, it &#8220;is already being used successfully in several projects such  as compilers, optimizers, obsfuscators, code generators  and analysis tools.&#8221;  BCEL also includes a bytecode verifier that is designed [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/jakarta-bcel/feed/</wfw:commentRss>
		</item>
		<item>
		<title>The alto Project Home Page: Link-time Code Optimization</title>
		<link>http://compiler-tools.org/archives/2004/04/01/the-alto-project-home-page-link-time-code-optimization/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/the-alto-project-home-page-link-time-code-optimization/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 22:50:13 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Alpha]]></category>

		<category><![CDATA[Tools:  binary rewriters and editors]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/the-alto-project-home-page-link-time-code-optimization/</guid>
		<description><![CDATA[The alto project from Arizona is a whole-program, link-time optimizer for the DEC Alpha, enabling optimization and specialization of library routines to their call sites.
Thanks to Manoj Plakal for the link.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/the-alto-project-home-page-link-time-code-optimization/feed/</wfw:commentRss>
		</item>
		<item>
		<title>WARTS &#8212; the Wisconsin Architectural Research Tool Set</title>
		<link>http://compiler-tools.org/archives/2004/04/01/warts-the-wisconsin-architectural-research-tool-set/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/warts-the-wisconsin-architectural-research-tool-set/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 22:33:42 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[SPARC]]></category>

		<category><![CDATA[Tools:  binary rewriters and editors]]></category>

		<category><![CDATA[Tools:  performance evaluation]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/warts-the-wisconsin-architectural-research-tool-set/</guid>
		<description><![CDATA[Thanks to Manoj Plakal for a link to WARTS, a toolset developed at Wisconsin. WARTS includes the Executable Editing Library (EEL), which enables analysis and modification of SPARC Solaris executable programs using a C++ API.  Distributed with the library are two tools built on EEL &#8212; a path profiler and an instruction count profiler. [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/warts-the-wisconsin-architectural-research-tool-set/feed/</wfw:commentRss>
		</item>
		<item>
		<title>CIL &#8212; Infrastructure for C Program Analysis and Transformation</title>
		<link>http://compiler-tools.org/archives/2004/04/01/cil-infrastructure-for-c-program-analysis-and-transformation/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/cil-infrastructure-for-c-program-analysis-and-transformation/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 22:16:40 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[OCaml]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/cil-infrastructure-for-c-program-analysis-and-transformation/</guid>
		<description><![CDATA[CIL is a tool and library that inputs C source code and outputs simplified C that is more amenable to program analysis.  It can generate CFGs and can perform several analyses and transformations out of the box.  See here for more details; some notables follow:

points-to analysis
various buffer-overrun protection transformations
transform all subprograms to have [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/cil-infrastructure-for-c-program-analysis-and-transformation/feed/</wfw:commentRss>
		</item>
		<item>
		<title>FrontC &#8212; C front-end for OCaml</title>
		<link>http://compiler-tools.org/archives/2004/04/01/frontc-c-front-end-for-ocaml/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/frontc-c-front-end-for-ocaml/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 22:03:26 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[OCaml]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/frontc-c-front-end-for-ocaml/</guid>
		<description><![CDATA[FrontC is a C front-end written in OCaml.  From the web page:

FrontC is an OCAML library providing a C parser and lexer. The result is a
syntactic tree easy to process with usual OCAML tree management.
It provides support for ANSI C syntax, old-C K&#38;R style syntax and the standard
GNU CC attributes.
It provides also a C [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/frontc-c-front-end-for-ocaml/feed/</wfw:commentRss>
		</item>
		<item>
		<title>ckit &#8212; tool for source-to-source translations of C code</title>
		<link>http://compiler-tools.org/archives/2004/04/01/ckit-tool-for-source-to-source-translations-of-c-code/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/ckit-tool-for-source-to-source-translations-of-c-code/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 21:53:17 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Standard ML]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/ckit-tool-for-source-to-source-translations-of-c-code/</guid>
		<description><![CDATA[Thanks to Suan Yong for a link to ckit, which is a Standard ML library for parsing C code into an AST.  Suan also mentions that ckit does not include a CFG generator, and requires preprocessed code.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/ckit-tool-for-source-to-source-translations-of-c-code/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Some documents on using GCC as a backend</title>
		<link>http://compiler-tools.org/archives/2004/04/01/some-documents-on-using-gcc-as-a-backend/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/some-documents-on-using-gcc-as-a-backend/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 17:43:20 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Papers: Compilation techniques for various languages]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/some-documents-on-using-gcc-as-a-backend/</guid>
		<description><![CDATA[Compilation of Functional Programming Languages using GCC is Andreas Bauer&#8217;s master&#8217;s thesis, which especially treats implementing tail calls in a compiler that uses C and GCC as a backend.
The Mercury Project has several papers on compiling Mercury to C:  Compiling logic programs to C using GNU C as a portable assembler (.ps.gz), Code generation [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/some-documents-on-using-gcc-as-a-backend/feed/</wfw:commentRss>
		</item>
		<item>
		<title>The GNU Compiler Collection</title>
		<link>http://compiler-tools.org/archives/2004/04/01/the-gnu-compiler-collection/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/the-gnu-compiler-collection/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 17:26:30 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Alpha]]></category>

		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Fortran]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[MIPS]]></category>

		<category><![CDATA[PA-RISC]]></category>

		<category><![CDATA[PPC]]></category>

		<category><![CDATA[SPARC]]></category>

		<category><![CDATA[StrongARM]]></category>

		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/the-gnu-compiler-collection/</guid>
		<description><![CDATA[Manoj Plakal points out that I have not mentioned GCC.  GCC, of course, has frontends for many languages, including C, C++, Objective-C, Java, Fortran, Pascal, and Ada; and backends for nearly every computer architecture ever created as well as a great many that weren&#8217;t.  It has a reputation for being difficult to use [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/the-gnu-compiler-collection/feed/</wfw:commentRss>
		</item>
		<item>
		<title>OCamlBurg</title>
		<link>http://compiler-tools.org/archives/2004/04/01/ocamlburg/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/ocamlburg/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 15:52:09 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[OCaml]]></category>

		<category><![CDATA[Tools:  code-generator generators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/ocamlburg/</guid>
		<description><![CDATA[From Christian Lindig and the C&#8211;&#8211; group comes OCamlBurg, which is an implementation of a Burg-like code-generator-generator that produces OCaml code.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/ocamlburg/feed/</wfw:commentRss>
		</item>
		<item>
		<title>C&#8211;&#8211;, portable assembly language</title>
		<link>http://compiler-tools.org/archives/2004/04/01/c-portable-assembly-language/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/c-portable-assembly-language/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 14:12:59 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Alpha]]></category>

		<category><![CDATA[Back-ends and portable IRs]]></category>

		<category><![CDATA[IA-64]]></category>

		<category><![CDATA[MIPS]]></category>

		<category><![CDATA[OCaml]]></category>

		<category><![CDATA[PPC]]></category>

		<category><![CDATA[StrongARM]]></category>

		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/c-portable-assembly-language/</guid>
		<description><![CDATA[C&#8211;&#8211; is a &#8220;portable assembly language&#8221; &#8212; a target language for compiler backends that can compile into native code on several platforms.  It is implemented in OCaml and appears sufficiently general to handle a wide range of language features: for example, all values are untyped strings of bits, multiple return values are possible, and [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/c-portable-assembly-language/feed/</wfw:commentRss>
		</item>
		<item>
		<title>DAISY &#8212; Architecture Emulation thru Dynamic Compilation</title>
		<link>http://compiler-tools.org/archives/2004/04/01/daisy-architecture-emulation-thru-dynamic-compilation/</link>
		<comments>http://compiler-tools.org/archives/2004/04/01/daisy-architecture-emulation-thru-dynamic-compilation/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 14:03:28 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[PPC]]></category>

		<category><![CDATA[Tools:  binary rewriters and editors]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/04/01/daisy-architecture-emulation-thru-dynamic-compilation/</guid>
		<description><![CDATA[DAISY is a dynamic recompiler that translates PowerPC executables into VLIW code on-the-fly, a page at a time, following program execution.  It is implemented in C, runs on AIX/PPC machines, and includes a simulator for the DAISY VLIW architecture.  Apparently, it can deal with self-modifying code, precise exceptions, and other thorny issues.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/04/01/daisy-architecture-emulation-thru-dynamic-compilation/feed/</wfw:commentRss>
		</item>
		<item>
		<title>MLRISC</title>
		<link>http://compiler-tools.org/archives/2004/03/31/mlrisc/</link>
		<comments>http://compiler-tools.org/archives/2004/03/31/mlrisc/#comments</comments>
		<pubDate>Thu, 01 Apr 2004 03:37:04 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Alpha]]></category>

		<category><![CDATA[Back-ends and portable IRs]]></category>

		<category><![CDATA[MIPS]]></category>

		<category><![CDATA[PA-RISC]]></category>

		<category><![CDATA[PPC]]></category>

		<category><![CDATA[SPARC]]></category>

		<category><![CDATA[Standard ML]]></category>

		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/03/31/mlrisc/</guid>
		<description><![CDATA[MLRISC is a configurable compiler back-end that supports generating code for Alpha, PA-RISC, Sparc, x86, PowerPC, MIPS, and TI C6x processors.  The MLRISC intermediate representation, target instruction set, flowgraph, and optimization suite are all parameterizable, so that a front-end can specialize each to produce the most suitable backend for a given language.  The [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/03/31/mlrisc/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Scale</title>
		<link>http://compiler-tools.org/archives/2004/03/31/scale/</link>
		<comments>http://compiler-tools.org/archives/2004/03/31/scale/#comments</comments>
		<pubDate>Wed, 31 Mar 2004 14:57:02 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Fortran]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/03/31/scale/</guid>
		<description><![CDATA[Scale is a compiler from the ALI group at Massachusetts.  Scale is a modular compiler that provides frontends for C, Java, and Fortran, and a backend that produces C.  Scale supports alias analysis (including implementations of Shapiro-Horwitz, Stensgaard, and a simple algorithm), SSA, and a battery of scalar optimizations (redundancy elimination, value numbering, [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/03/31/scale/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Vmgen interpreter generator</title>
		<link>http://compiler-tools.org/archives/2004/03/31/vmgen-interpreter-generator/</link>
		<comments>http://compiler-tools.org/archives/2004/03/31/vmgen-interpreter-generator/#comments</comments>
		<pubDate>Wed, 31 Mar 2004 14:43:07 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Forth]]></category>

		<category><![CDATA[Tools:  VM/interpreter generators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/03/31/vmgen-interpreter-generator/</guid>
		<description><![CDATA[Vmgen is a tool implemented in gforth.  Vmgen transforms a description of VM instructions into a high-performance interpreter; it can generate threaded code, schedule VM instruction dispatch, and keep the top of the stack in a register.  Vmgen can be used with either stack-based or register-based VMs.
]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/03/31/vmgen-interpreter-generator/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Open64 and derivatives</title>
		<link>http://compiler-tools.org/archives/2004/03/31/open64-and-derivatives/</link>
		<comments>http://compiler-tools.org/archives/2004/03/31/open64-and-derivatives/#comments</comments>
		<pubDate>Wed, 31 Mar 2004 14:36:33 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Fortran]]></category>

		<category><![CDATA[IA-64]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/03/31/open64-and-derivatives/</guid>
		<description><![CDATA[Open64 (formerly Pro64) is an open-source compiler for C++ and Fortran, targeting IA-64.  It uses an intermediate language called WHIRL, and includes &#8220;inter-procedural analysis and optimizations, loop-nest optimizations, scalar global optimizations, and code generation.&#8221;  The mailing list for Open64 developers seems to get between 10-30 messages a month.
The CAPSL group at Delaware has [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/03/31/open64-and-derivatives/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Open Runtime Platform</title>
		<link>http://compiler-tools.org/archives/2004/03/31/open-runtime-platform/</link>
		<comments>http://compiler-tools.org/archives/2004/03/31/open-runtime-platform/#comments</comments>
		<pubDate>Wed, 31 Mar 2004 14:09:05 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/03/31/open-runtime-platform/</guid>
		<description><![CDATA[The Open Runtime Platform is a modular virtual machine infrastructure, enabling creation of JIT and GC components that are not tightly-coupled and can be swapped out.  It is implemented in C and C++ and runs on IA-32 Linux and Windows.  Papers about the JIT and GC strategies that it includes are available from [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/03/31/open-runtime-platform/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Zephyr Compiler Infrastructure</title>
		<link>http://compiler-tools.org/archives/2004/03/31/zephyr-compiler-infrastructure/</link>
		<comments>http://compiler-tools.org/archives/2004/03/31/zephyr-compiler-infrastructure/#comments</comments>
		<pubDate>Wed, 31 Mar 2004 07:41:20 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
		
		<category><![CDATA[Back-ends and portable IRs]]></category>

		<category><![CDATA[C and/or C++]]></category>

		<category><![CDATA[Haskell]]></category>

		<category><![CDATA[Java/JVM]]></category>

		<category><![CDATA[Standard ML]]></category>

		<category><![CDATA[Tools:  IR translators]]></category>

		<category><![CDATA[Tools:  code-generator generators]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2004/03/31/zephyr-compiler-infrastructure/</guid>
		<description><![CDATA[Zephyr Compiler Infrastructure provides a means to define an intermediate representation and write passes on it in several languages; it also provides a hardware description language to power a code-generator generator.  From the web site:

If you describe your intermediate forms using Zephyr&#8217;s Abstract Syntax Description Language (ASDL), we can generate data-structure definitions in C, [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2004/03/31/zephyr-compiler-infrastructure/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>
