LISP I Programmer's Manual - Software Preservation Group

( , SXD, G0011,4),LD&,G0002)( ,C;LA,G&I~)( ,TSX,EQUAL,4)( ,STO,GOOO~O)( , CLA, GOOO~O)( , TZE, G0009)( ,CLA,$ONE)( ,TRA,GOOO~)(GOOO~ ,BSS, 0)( , LXD, G0007,4)( YCLAYOY4)( ,PDX,O,4)( , SXD,GOOO7,4)( ,T~A,G0006)( ~ 0 0 0 50), ~ ~ ~ ~( ,STO,GOOO~)( ,C~~,G0004)( ,LXDY G0001, 4)( 9TR~,1,4)END OF APPLY, VALUE IS ...(MEMLIS )2) maplist[x;g]result of equal test (note that thecompiler stores everything it computes)transfer if car[M1] f xotherwise return with AC = Tcdr [ MI 1set MI = cdr[M1]answer (true (one) or false (zero))restore original index register 4re turnThe function maplist[x;g] is more complicated than the pre-vious example, due both to its use of a function g, and to thefact that maplist may itself be used recursively by g. The lat-ter fact requires that the arguments be saved each time theroutine is entered, and this is done by storing them in a publicpush-down list.' The current next available space in this1See page 144 of the Quarterly Report referred to on the firstpage of Chapter 2.-