Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!nstn.ns.ca!news.cs.indiana.edu!samsung!spool.mu.edu!snorkelwacker.mit.edu!paperboy!hsdndev!spdcc!iecc!compilers-sender From: lavinus@csgrad.cs.vt.edu Newsgroups: comp.compilers Subject: Re: intermediate representation Keywords: question, optimize, design, analysis Message-ID: <963@creatures.cs.vt.edu> Date: 22 Feb 91 20:42:11 GMT References: <9102210223.AA15327@cyan.cs.rochester.edu> Sender: compilers-sender@iecc.cambridge.ma.us Reply-To: lavinus@csgrad.cs.vt.edu Organization: Virginia Tech Computer Science, Blacksburg, VA Lines: 24 Approved: compilers@iecc.cambridge.ma.us Hi! In answer to both your questions, I hope: ideally, intermediate representations should not be at all machine dependent (beyond the fact that they might be dependent on, say, the Von Neumann architecture). When I think of intermediate code, I think of something along the lines of P-code (by Wirth), which is a sort of machine code for a simple, hypothetical, stack-based machine, and is quite generic and non-machine-dependent. That might be a good one for your purposes. By the way, could you (or a colleague) suggest a good book or reference on such back-end compiler optimization? Thanks and good luck... Joe Lavinus -- Joseph W. Lavinus Virginia Tech, Blacksburg, Virginia email: lavinus@csgrad.cs.vt.edu [I suspect that after you read all about compiler optimization you'll be more sympathetic to machine dependent intermediate code. -John] -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request. Brought to you by Super Global Mega Corp .com