Path: utzoo!attcan!uunet!snorkelwacker!spdcc!ima!esegue!compilers-sender
From: napi@rangkom.MY (Mohd Hanafiah b. Abdullah)
Newsgroups: comp.compilers
Subject: Intermediate Representation
Message-ID: <1990Aug07.153407.8877@esegue.segue.boston.ma.us>
Date: 7 Aug 90 15:34:07 GMT
Sender: compilers-sender@esegue.segue.boston.ma.us
Reply-To: napi@rangkom.MY (Mohd Hanafiah b. Abdullah)
Organization: MIMOS, Malaysia
Lines: 27
Approved: compilers@esegue.segue.boston.ma.us

I would like know what people think is the best Intermediate Representation
(IR) to be used for highly effective optimizations and code generation, and
it should be portable.  An IR is one of the most crucial considerations in
designing a competent compiler.

Examples of IRs that I know:
(1) Abstract-syntax-tree (looks like Scheme code)
(2) DAG
(3) Three address code
(4) P-code
(5) Stanford's U-code

I'm more leaning towards "abstract-syntax-tree" since it is portable (machine
independent), readable, visibility of high-level structures (eg. loops) for
effective optimizations, language independent most of the time.

What do you think?

Please respond by email since I don't have online access to USENET
news.  Thanks.

Hanafiah
[But copy your messages to compilers if they're of general interest,
please. -John]
-- 
Send compilers articles to compilers@esegue.segue.boston.ma.us
{spdcc | ima | lotus| world}!esegue.  Meta-mail to compilers-request@esegue.