anjakefala
/ Corkboard.md
Last active
May 24, 2017 23:04
anjakefala
/ Lisp.py
Last active
December 21, 2016 19:24
Lisp Parser for Recurse Center Pair Programming Meeting
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #Lisp parser | |
| #Write code that takes some Lisp code and returns an abstract syntax tree. The AST should represent the structure of the code and the meaning of each token. For example, if your code is given "(first (list 1 (+ 2 3) 9))", it could return a nested array like ["first", ["list", 1, ["+", 2, 3], 9]]. | |
| #During your interview, you will pair on writing an interpreter to run the AST. You can start by implementing a single built-in function (for example, +) and add more if you have time. | |
| def are_par_balanced(command): | |
| """ | |
| Checks that the parantheses in the Lisp command are balanced |