COMPSCI 61A Lecture Notes - Lecture 26: Eval, Generic Function, Recursive Descent Parser

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

Document Summary

Maps composition revisions due sunday 11/06 @ 11:59pm. Check your email for a link to your scored exam. New midterm recovery policy: students who scored below 45/90 on midterm 1 & midterm 2 to combined can earn back exam points by attending discussion. A scheme list is written as elements in parentheses: ( ) Each can be a combination or primitive. e. g. (+ (* 3 (+ (* 2 4) (+ 3 5))) (+ (- 10 7) 6)) The task of parsing a language involves coercing a string representation of an expression to the expression itself. Parsers must validate that expressions are well-formed and create a nested hierarchal structure out of that expression. Parsing is the process of taking text input and turns those into some sort of object that represents the expressions while validating their syntax. A parser takes text and returns an expression.