CPSC 201: Introduction to Computer Science
Instructor: Carsten Schürmann
Department of Computer Science
Yale University
Time: MWF 11:30-12:20
Room: AKW200
|
|
Home |
|
|
Schedule |
|
|
Handouts |
|
|
Assignments |
|
|
Projects |
|
|
Links |
Lecture 28
Among the many possibilities on how to parse a file, we present recursive descent parsing. We discuss grammars, nonterminal symbols, terminal symbols, and production rules. As example, we use a simply arithmetic language which contains only integers, +, *, and parentheses. For reasons of simplicity we ignore operator precedence.Code: parser.sml. A parser based on continuations for the language of arithmetic expressions.
Reading: Invitation to Computer Science
Chapter 9.2.2