λ³Έλ¬Έ λ°”λ‘œκ°€κΈ°

University of California, Berkeley/ElectricalEngineering & ComputerSciences

Week 6

https://cs61a.org/articles/scheme-builtins.html

 

Scheme Built-In Procedure Reference | CS 61A Summer 2019

Scheme Built-In Procedure Reference Last Updated: Summer 2018 This document serves as a reference for the built-in procedures in the Scheme project and staff Scheme interpreter. The web interpreter includes several additional built-in procedures. In all of

cs61a.org

https://cs61a.org/articles/scheme-spec.html

 

CS 61A Scheme Specification | CS 61A Summer 2019

The version of Scheme used in this course is not perfectly true to any official specification of the language, though it is perhaps closest to R5RS, with some features and terminology from other versions, both older and newer. We deviate from the official

cs61a.org

https://drive.google.com/file/d/0B9f1uNGYHmJ9UzhQT1NSOG5seXc/view

 

kavi_scheme.pdf

 

drive.google.com

http://www.tmmydngyn.me/cs61a/guides/tail-recursion.html

 

Tail Recursion

This page is under construction! Scheme supports optimized tail recursion, meaning that if a function is called in tail context, Scheme will close the frame that called it and simply return the value that the tail call returns. Scheme thus allows for an un

www.tmmydngyn.me

https://docs.google.com/presentation/d/19TWNzh5YQkd7qnPhmjL9Hwxb6KL6yskP16L7CH8CE6o/edit#slide=id.p

 

Spring 2016 Tail Recursion Review

Tail Recursion Review Spring 2016

docs.google.com

http://albertwu.org/cs61a/review/tail/exam.html

 

Tail Recursion: exam

If you need help reviewing Tail Recursion, take a look at these resources: Each question has a "Toggle Solution" button -- click it to reveal that question's solution. You need to enable JavaScript to view the solutions. Conceptual Questions Which of the f

albertwu.org

https://alex.stennet.com/interpreters.html

 

Interpreters.md

Interpreters So whats an interpreter? A program that accepts statements, executes them immediately and then outputs the result. At it's core these are the only 3 things an interpreter does Accepts inputExecutes statement inputtedOutputs result An interpret

alex.stennet.com

https://docs.google.com/document/d/1-5KnTJsqBL6TCQjiVsv2sUyiegLs9IqSlWzQEMdde_Q/edit

 

Interpreters Review Worksheet

Interpreters Review Worksheet Fall 2016 CS 61A Notes Expression Rules for evaluation Name Literal Call expression Special form Rules for evaluation begin and or cond if let define (procedure) define (name) lambda quote Problems 1. ...

docs.google.com

http://albertwu.org/cs61a/review/interpreter/exam.html

 

Interpreters: exam

If you need help reviewing Interpreters, take a look at these resources: Each question has a "Toggle Solution" button -- click it to reveal that question's solution. You need to enable JavaScript to view the solutions. Conceptual Questions Question 1 Given

albertwu.org

https://docs.google.com/presentation/d/1F9bffNArt0AnBfB7Y8TWlKtSLvZ6ek-JX95E_Bhl3js/edit#slide=id.p

 

Slides

Final Review: Macros Tammy Nguyen (tammynguyen@berkeley.edu) Katherine Liu (katherineliu28@berkeley.edu) May 2, 2018

docs.google.com

https://docs.google.com/document/d/1-AYfeYT2YtCaQd13MegSH8Jh-ZlxhcE6_XxMYcJgeds/edit

 

Macro Procedures

Macro Procedures Objectives: Understand what it means to treat an expression as data, the differences compared to regular Scheme procedures, and strategies for writing macro procedures. Many credits to Chris Allsman and Jen Thakar List Construction To get

docs.google.com

https://docs.google.com/document/d/1XPdc4cUITvdbgAxsRF0Ko7LnnH3VlyabWFYxwwGDoCo/edit

 

Worksheet

Macros Review May 2, 2018 Discussion questions All Scheme expressions are either atomic expressions or ______________________. How are call expressions evaluated? (Hint: There are three steps.) What do call expressions and special form expressions (e.g. if

docs.google.com

https://docs.google.com/document/d/1FGMA4a6v1SLZwMcgEWfBBgZ_PJV-cLhR_CSeCzB18TI/edit

 

Macros Worksheet

; Warmup what does Scheme display? '(print hello) `(one ,(+ 1 1) three ,(+ 3 1)) (cons 'print (cons 'hello nil)) (list 'and (+ 3 2) '(- 2 1) #f) (append (list 2) '(3)) `,(print hi) `,(print '(print hi)) `(define (square ,((lambda () 'x))) (* x x)) ; Q0 ; W

docs.google.com

https://drive.google.com/drive/folders/17a3S_baEC1E_ojDSuCdvPej2LdAC8qPQ

 

Shea - Google λ“œλΌμ΄λΈŒ

 

drive.google.com

 

'University of California, Berkeley > ElectricalEngineering & ComputerSciences' μΉ΄ν…Œκ³ λ¦¬μ˜ λ‹€λ₯Έ κΈ€

More Scheme  (0) 2019.07.31
Scheme  (0) 2019.07.30
Interfaces  (0) 2019.07.26
Linked Lists & Mutable Trees  (0) 2019.07.26
Inheritance  (0) 2019.07.24