LISP I Programmer's Manual - Software Preservation Group

More documents

Recommendations

Info

push-down list is indicated by the (complement of the) compilerpublic push-down list indicator, $CPPI. This indicator is testedby the program against the last available space in the list,($ENPDL, or end of push-down list), and when there is no morespace available an error transfer to $NOPDLAnother use of storage is illustrated below by the - consstops the computation.function which sends the result of the - cons to free storage.Each time the - cons is used, a test is made of the indicator,$FREE, which gives the (complement of the) next free-storage lo-cation available. When free storage has been used up the subroutine$FROUT is used to call in the garbage collector to retrievesome storage, (see Section 6.3.)The treatment of the function g depends on whether it is de-fined by a subroutine or by an S-expression to be interpreted.If there is a subroutine for g, g will be in the form of an fnstructionstored in location G0003, so that the TSX,GOOO~,~ in the programbelow amounts to a transfer to the subroutine. If g is definedby an S-expression, then g, as stored in G0003, will have a dec-rement pointing to the S-expression.The subroutine COMPAT be-low carries out the interpretation of the expression using theAPPLY operator.Incidentally, the 1 in the line following theuse of COMPAT has been set up by the compiler to indicate thatg is a function of one argument.The <strong>LISP</strong>-SAP program is the following:FUNCTION APPLY (F, X, P ) HAS BEEN ENTERED, ARGUMENTS. .COMPILE( ( (LABEL, MAPLIST, (LAMBDA,(x, G ),(PROG, (MI, M2), (COND, ( (NULL, X) ,(RETURN,NIL))), (SETQ,MI~ CONS^ (G,x),NIL)), (sETQ,M~,M~),AI,(SETQ, X, (CDR, X) ),(COND,( (NULL, X) ,(RETURN, MI) ) ),(RPLACD, M2,(CONS, (G,x),NIL)),(~ETQ,M~, (CDR,M~)19 (G0,Al)) 1) 1)
push-down(MAPLIST,BSS, 0)( ,SXD,GOOO~,~)( , ST&, $ARG~)( ,LXD, $CPPI, 4)( ,TXH,*+~,~,$ENPDL)( ,TSX,$NOPDL+~,~)( ,LD&,G0001)( ,STQ90,4)( ,LD&,G0003( ,STQ,1,4)( , LDQ, GO011 )( ,STQ,2,4)( , LDQ, G0002)( ,STQ,3,4)( , LDQ, GOO09 )( ,sTQ,~,~)( ,TIX,*+1,4,5)( , SXD, $CPPI, 4)( ,LDQ,$ARG~)( ,STO,G0002)( , STQ, GOO03 )( , CLA, G0002)( , TNZ , GO008 )( , CLA, $ZERO)( ,TRA,G0005)(GO~O~,ASS, 0)(GOOO~ ,BSS, 0)( , CLA, GO002 )( ,LXD9 G0003,4)( ,TXH,*+3,4,0)( ,TSX,GOOO3,4)( ,TRA,*+~)( ,SXD,*+2,4)save index register 4store g in temporary storage to free MQcompiler push-down list indicatortransfer to *+2 if space availableotherwise (no more left), stop on errorcurrent index register 4 -+current g -+ push-down listcurrent M2 -+ push-down listcurrent x -+push-down listcurrent Mie push-down listupdate push-down list indicatorstore xstore glistnull[xl = Fnull[x] = Treturn, value = NILnull[x] = Fextra (unused) line due to compilerx -+ ACgtransfer if g is S-expressionotherwise use g as subroutinereturns here from subroutine for gset up pointer to S-expression for COMPAT
Page 1:
Artificial Intelli~cnce GroupJ. McC
Page 5:
Contents1 . Introduction ..........
Page 9 and 10:
2. Recursive Functions of Symbolic
Page 12 and 13:
expression was, defined, the meanin
Page 14:
Let f be an expression that stands
Page 17 and 18: There is a twofold reason for depar
Page 19 and 20: 2, eq - 4eq[x;y] is defined if and
Page 21 and 22: 2. sub~t[x;~;z]This function gives
Page 23 and 24: z;eq[caar[x];z]sub2[x;~];~((u1,vi)
Page 25 and 26: The S-functLon apply is defined byI
Page 27 and 28: The list p - could be eliminated, a
Page 29 and 30: 3. LISP PrimerThe features of LISP
Page 31 and 32: The answer ( ((x A) B) (X A) ) will
Page 33 and 34: one introducing it into the consequ
Page 35 and 36: h,~~,pand)Y,SP5a. Rule4>: If j,++h,
Page 37 and 38: to one of the 10 rules. The formula
Page 39 and 40: (~111(LAMBDA( ~1 A2 A C) (COND ((NU
Page 41 and 42: This causes the functions mentioned
Page 43 and 44: 4. The LISP Programming SystemIn th
Page 45 and 46: Example 3:The following example, on
Page 47 and 48: In either case, if a machine-langua
Page 49 and 50: Note that the argument x starts wit
Page 51 and 52: sion whose first element may be LAM
Page 53 and 54: 5 = (atomic function, arguments): C
Page 55 and 56: - PROG is a special form described
Page 57 and 58: When a list beginning with GO is en
Page 59 and 60: Since the program feature will be u
Page 61 and 62: and goes ahead after printing out(f
Page 63 and 64: eturn[fn[a]In terms of the M-type n
Page 65: ( , SXD, G0011,4),LD&,G0002)( ,C;LA
Page 69 and 70: Ls.( ,O,U( ,STO,G0015)( , LXD, $FRE
Page 71 and 72: Running a LISP ProgramIn this secti
Page 73 and 74: SET :Note:FLX*:CRD*:FIN:This card w
Page 75 and 76: Sense switches used:SWITCH NUMBERUS
Page 77 and 78: The Flexowriter Sys tem (for M.1.T.
Page 79 and 80: indicates carriage returnindicates
Page 81 and 82: TEN-ModeThere are ten buffers of co
Page 83 and 84: ErrorsTyping errors may be erased b
Page 85 and 86: (from the tab type-in) will be proc
Page 87 and 88: answerTENCAR ((A@) 0- LINE NUMBER M
Page 89 and 90: 6. List StructuresMuch of the follo
Page 91 and 92: y either the list structure of Fig.
Page 93 and 94: which is represented asFirst we con
Page 95 and 96: the location of the association lis
Page 97 and 98: and the decrement of the TXL instru
Page 99 and 100: the 2's (8's) complement of an octa
Page 101 and 102: 25207 052567 05257025210 000000 000
Page 103: garbage collector does a linear swe
Page 106 and 107: The function collapse, is defined a
Page 108 and 109: THE TIME IS NOW 2/16 1139.7FUNCTION
Page 110 and 111: DEFINE( ( (RVRSE, (LAMBDA, (L ) JCO
Page 113 and 114: 8. Error Indications Given by LISPB
Page 115 and 116: Errors due to computer inadequacies
Page 117 and 118:
Errors during the operation of the
Page 119 and 120:
9. Functions Available in LISPIn th
Page 121 and 122:
s[x;y] : machine languageThe value
Page 123 and 124:
eval[e;b] - : machine languageThe r
Page 125 and 126:
Defining Functions:The argument of
Page 127 and 128:
MORE]nconc[x;y]: machine languageTh
Page 129 and 130:
evaluated functions. - map is used
Page 131 and 132:
-ins t [x;y; z]: machine languageHe
Page 133 and 134:
prog[prin2[d~rinl[~];The function p
Page 135 and 136:
puncha[x] : machine languageThe fun
Page 137 and 138:
9.2 Special Formsquote : machine la
Page 139 and 140:
function[ f ] : machine language; s
Page 141 and 142:
desc[cdr[x];cdr[y]-desc[x;y] : mach
Page 143 and 144:
eturn[^]intv[x] : machine language;
Page 145 and 146:
The program for compsrch has the pr
Page 147 and 148:
NIL;T+The value of - cpl is the loc
Page 149 and 150:
--- ~reaterlp; q] : machine languag
Page 151 and 152:
matrixmultiply[x;y] : machine langu
Page 153 and 154:
9.5 Alphabetic Index to FunctionsFu
Page 155 and 156:
Function Page .mapcon .............
Page 157 and 158:
GENERAL INDEXActive register, 96APP
Page 159 and 160:
GENERAL INDEXFunctions, 3alphabetic
Page 161 and 162:
GENERAL INDEXPropositionalcalculus;
show all

LISP I Programmer's Manual - Software Preservation Group

Create successful ePaper yourself

Delete template?

Save as template?