✳flâneur — a map of the web's best reading

Problem Set 3: Memely

web.mit.edu · 5,749 words · saved by 1 readers

In this problem set, we will explore parsers, recursive data types, and equality for immutable types. Compared to the previous problem sets, we are imposing few restrictions on how you structure your code. In addition, much of the code that you write for problems in this problem set will depend on how you decided to implement earlier parts of the problem set. Read through the entire assignment before writing any code, and plan for iterating on your solution. Design Freedom and Restrictions On several parts of this problem set, the classes and methods will be yours to specify and create, but you must pay attention to the PS3 instructions sections in the provided documentation. You must satisfy the specifications of the provided interfaces and methods. You are, however, permitted to strengthen the provided specifications or add new methods. On this problem set, unlike previous problem sets, we will not be running your tests against any other implementations. On this problem set, Didit pr

Problem Set 3: Memely Problem Set 3: Memely The deadlines for this problem set are shown on the course calendar . In this problem set, we will explore parsers, recursive data types, and equality for immutable types. Compared to the previous problem sets, we are imposing few restrictions on how you structure your code. In addition, much of the code that you write for problems in this problem set will depend on how you decided to implement earlier parts of the problem set. Read through the entire assignment before writing any code, and plan for iterating on your solution. Design Freedom and Rest

Explore this link on the map →

saved by

related reading