COMPSCI 61A Study Guide - Final Guide: London Academy Of Music And Dramatic Art, Eval

• School: Berkeley
• Department: Computer Science
• Course: COMPSCI 61A
• Professor: De Nero John

Document Summary

Recursive: evakoperator , operands) of cakexpressi, apply procedure on arguments. Oval sub expressions ex : if statements g enthrnmentforsymbl nokp. Creates a new environment each time a user. Recursive : defined procedure is applied: eval ( body) of. Evaluating expressions are returned other expressions are presented by. Scheme lists called combinations . ex : if lamda define identified by initial part of list any combination that not known as a special form call expression logical. , wind evaluate the predicate and the choose. Quote : torn an expression into data by quoting "t ex :cquote g 12)) g i 2) not (3) ( can use. Yg id as a short form : scheme read parser converts shorthand to a combination.