-
and & or, bindings, BYU, CS61a, do_and_form(), do_cond_form(), do_or_form(), expressions, is_scheme_true(), make_let_form(), part 3, scheme, scheme interpreterGuide to the Scheme Interpreter Project (BYU CS 111) Part 3
Part 1 Part 2 We are finally to the last part of building our interpreter for Scheme in Python. In Part 3 we will implement our special form functions so that we can interpret And/Or, Conditionals, and the Let form in Scheme. Problem 12: And & Or Problem 12 deals with the And and Or…
-
begin, BYU, cs 111, CS61a, do_lambda_form(), eval_all(), make_child_frame(), mu, MuProcedure, part 2, scheme interpreterGuide to the Scheme Interpreter Project (BYU CS 111) Part 2
Part 1 if you missed it In part 2 we will be implementing the code for procedures. By the end of this, you will be able to interpret user-defined functions, lambda functions, and something special called “Mu-procedures” that you will soon learn to dislike. This part will be handling problems 6-11. Good luck. Problem 6:…
-
BYU, cs 111, define(), do_form_special(), lookup(), part 1, procedures, quote, scheme interpreter, scheme_eval()Guide to the Scheme Interpreter Project (BYU CS 111) Part 1
part 2 The Scheme Interpreter project is the most daunting and if you’re me, by far the longest assignment (14 hours) in CS 111. In the project, you program bits and pieces of an interpreter for scheme in python. The project details and files can be found on the CS 111 website. Before beginning the…
James Elias Phelps
BYU CS Student