This is the mail archive of the
mailing list for the GCC project.
Re: Language-independent functions-as-trees representation
- From: Mark Mitchell <mark at codesourcery dot com>
- To: Jason Merrill <jason at redhat dot com>, Richard Henderson <rth at redhat dot com>
- Cc: Per Bothner <per at bothner dot com>, Diego Novillo <dnovillo at redhat dot com>, "gcc at gcc dot gnu dot org" <gcc at gcc dot gnu dot org>
- Date: Sun, 21 Jul 2002 13:58:14 -0700
- Subject: Re: Language-independent functions-as-trees representation
--On Saturday, July 20, 2002 01:47:18 PM +0100 Jason Merrill
I'd like to return to the discussion of a language-independent
functions-as-trees representation that was going on in January.
I don't have much of an opinion about this once we get to SIMPLE, at
least not yet.
My disagreement with Per is closer to the front end; I would really
like the internal representation produced from C++ semantic analysis
to look like C++ -- with various implicit things made explict (like
default arguments, choice of overloaded function, choice of template
specialization, action to take on cleanup of object, etc.)
In SIMPLE, one place where I would like the statement/expression to come
in to play is the following:
If two expressions are "the same", i.e., both are "x + y", then they
are actually the same pointer.
In other words, statements are the control flow glue that holds
computations together. The computations don't care about where they
are in the control flow. This makes some optimizations easier and
more efficient, and it's a very appealing view of the world.
Mark Mitchell email@example.com
CodeSourcery, LLC http://www.codesourcery.com