COMPSCI 61A Lecture Notes - Lecture 24: Neal Stephenson, Computer Language

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

Document Summary

Midterm 2 scores and solutions will be released when they"re ready Completing the online participation form by wednesday 10/26 @ 11:59pm. Many of the ideas learned in one programming language easily transfer to another. Scheme is an older language that was in uential in the creation of python. The greatest single programming language ever designed. - alan kay. The only computer language that is beautiful. - neal stephenson. God"s programming language. - brian harvey, berkeley cs instructor extraordinaire. Primitive expressions: 2, 3. 3, true, +, quotient, Numbers are self-evaluating; symbols are bound to values. Call expressions include an operator and 0 or more operands in parentheses. A special form in scheme is any combination that is not a call expression. Note that scheme, like python, is lexically scoped. Execution of this scheme code can be done using downloaded interpreters or online ones embedded into a webpage. Project 4: build a python program that implements a scheme interpreter.