Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6185Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Golden, Jeffrey P. | - |
| dc.date | 2004-10-04T14:44:30Z | - |
| dc.date | 2004-10-04T14:44:30Z | - |
| dc.date | 1970-12-01 | - |
| dc.date.accessioned | 2013-10-09T02:43:51Z | - |
| dc.date.available | 2013-10-09T02:43:51Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-210 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6185 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | The LISCOM version of the AI group PDP/6 LISP compiler is a descendant of the original Greenblatt-Nelson compiler, and is a friendly sibling to the COMPLR version maintained by Jon L. White. The compiler operates in two passes to translate LISP code into LAP code. The first pass performs a general study of the S-expression function definition which is to be compiled, producing as output a modified S-expression and various tables attached to free variables. The second pass does the actual compilation (generation of assembly code), making use of the transformations performed and the information gathered by the first pass. The LISCOM version of the compiler is being used as a vehicle for the implementation of "fast arithmetic" in LISP. This work is being done under the auspices of the MATHLAB project of the AI Laboratory. The early stages of the compiler implementation were handled by W. Diffie, and the work has been continued by the present author. | - |
| dc.format | 5248915 bytes | - |
| dc.format | 612434 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-210 | - |
| dc.title | A User's Guide to the A.I. Group LISCOM LISP Complier: Interim Report | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.