[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Vanishing MrEd

To: GregP@bsquare.com
Subject: Re: Vanishing MrEd
From: Matthias Felleisen <matthias@cs.rice.edu>
Date: Thu, 18 Jan 2001 21:00:12 -0600 (CST)
CC: plt-scheme@fast.cs.utah.edu
In-reply-to: <E4C0D8267DAA6141B77F1A4EAAEB2B91BE3DA5@seapriv1> (message fromGreg Pettyjohn on Thu, 18 Jan 2001 17:46:44 -0800)
References: <E4C0D8267DAA6141B77F1A4EAAEB2B91BE3DA5@seapriv1>
Reply-to: matthias@rice.edu
Sender: owner-plt-scheme@fast.cs.utah.edu


Answer: part 2. 

Yes, one can compile plain Scheme to assembly code via a CPS
transformation, and the CPS form is close to a flow-chart program. 

No, one doesn't have to. 

Turning recursions into gotos is necessary, because the machine doesn't
know about recursion. (Well, one could build (and people have) a machine
that's a bit better on this stuff than what we have.) So eventually a 
program must be turned into a "program" that consists of pushes, loads,
pops, and branches. 

EoPL by Friedman and Wand is a good first step in this direction. 

Appel's Tiger book is a reasonable introduction to compilation with cps and
friends. 

-- Matthias

References:
- Vanishing MrEd
  - From: Greg Pettyjohn <GregP@bsquare.com>

Prev by Date: Re: Vanishing MrEd
Next by Date: Connecting behind an http proxy
Prev by thread: Re: Vanishing MrEd
Next by thread: tail calls [was: Vanishing MrEd]
Index(es):
- Date
- Thread