Monkey

Implementing monkey interpreter while learning from Writing an Interpreter in GO `

KeyNotes-

1. Pratt top-down parsing is used by parser to populate the AST, as this is a simple and scalable strategy.

2. Walk-the-tree strategy is used at the time of evaluation. A tree- walking interpreter that recursively evaluates an AST is probably the slowest of all approaches, but easy to build, extend, reason about and as portable as the language it’s implemented in. We’re going to take the AST our parser builds for us and interpret it “on the fly”, without any preprocessing or compilation step.

3. No garbage collector of its own does monkey posses. GO's garbage collector does the job good enough for us.;)

Some code snippets

Let statements-

    let a=2; #Semicolons can be ommitted or used#

Functions-

    let a=fn(a,b){
        a+b;  #Functions are first class citizens and can be used as a variable,passed around in functions,etc#
    }

Expressions-

    5               #Will return 5#
    5+5             # Will return 10 #

    10              #Given all these expression statements, output of last expression will be returned , in this case 10. i.e output of program

Comments-

    # comments are enclosed between two hashes like this #

    # 
        Multiline comments can be made like this.
    #

    # in case other hash is not encountered, all the code after first one will be commented.

Objects-

    Objects are enclosed in double-curly brackets instead of single. 

    let a ={{
        "name:"ashish"
    }}