Related articles |
---|
Wanted: Prolog compiler josh@dewey.soe.Berkeley.EDU (1990-01-31) |
Re: Wanted: Prolog compiler budd@mist.cs.orst.edu (1990-02-01) |
Re: Wanted: Prolog compiler grunwald@foobar.colorado.edu (Dirk Grunwald) (1990-02-02) |
From: | Dirk Grunwald <grunwald@foobar.colorado.edu> |
Newsgroups: | comp.compilers |
Date: | 2 Feb 90 18:59:15 GMT |
References: | <1990Jan31.045546.20990@esegue.segue.boston.ma.us> <1990Feb1.224159.1123@esegue.segue.boston.ma.us> |
Distribution: | na |
Organization: | University of Colorado at Boulder |
In-Reply-To: | budd@mist.cs.orst.edu's message of 1 Feb 90 22:41:59 GMT |
>>>>> On 1 Feb 90 22:41:59 GMT, budd@mist.cs.orst.edu (Tim Budd) said:
> If all you want are ideas (and not, for example, efficiency), then a book
> I STRONGLY recommend is ``Programming Languages: An Interpreter-Based
> Approach'', published by Addison-Wesley. The book describes, and gives
> interpreters for, the ``basic-core'' (i.e., subsets) of LISP, APL, Scheme,
> Sasl, Clu, Smalltalk, and finally Prolog. All of the interpreters are
> reproduced in the back of the book, and all are available via ftp from
> the author. (He can be reached as kamin@cs.uiuc.edu).
I've been using that book this semester, and the only problems I've
really had with it are that it doesn't cover some fundemental concepts
that the students need to know, mainly things like action records &
environments. I've been using chapters from MacLennen as well as Pratt
to cover these topics.
I've also converted the Pascal code into C, using the wonder p2c
utility from csvax.caltech.edu.
Simon Kaplan (kaplan@cs.uiuc.edu) also has some of the interpreters
available in Scheme; I think this would have been the better approach
for all the interpreters, because it removes much of the environment
manipulation code. However, you students would have to know scheme.
Dirk Grunwald -- Univ. of Colorado at Boulder (grunwald@foobar.colorado.edu)
(grunwald@boulder.colorado.edu)
Return to the
comp.compilers page.
Search the
comp.compilers archives again.