monkey

package module
v1.3.6-0...-af85d19 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jan 14, 2024 License: MIT Imports: 16 Imported by: 0

README

Monkey

monkey-lang

Go Report Card Go Reference

Monkey programming language interpreter designed in Writing An Interpreter In Go. A step-by-step walk-through where each commit is a fully working part. Read the book and follow along with the commit history.

Status

06 January 2024

For the last few weeks I've been working on optimizing this implementation of Monkey.

Sometime In the past

Still working on a self-hosted Monkey lang (Monkey written in Monkey).

Read and Follow

Read the books and follow along with the following commit history. (This also happens to be the elapsed days I took to read both books!)

See: Reading Guide

Please note that whilst reading the awesome books I slightly modified this version of Monkey-lang in some places. For example I opted to have a single RETURN Opcode.

Quick start

$ go install git.mills.io/prologic/monkey-lang/cmd/monkey@latest
$ monkey
Monkey v0.0.1 on Darwin
>>>

You can also execute program files by invoking monkey <filename> There are also some command-line options:

$ ./monkey -h
Usage of ./monkey:
  -D	Enable Compiler and VM debugging
  -T	Enable VM tracing
  -c	Compile a monkey file into a '.mc' bytecode file
  -s	Use simple REPL instead of opening a terminal
  -v	Print Monkey version information

Development

To build run make.

$ git clone https://git.mills.io/prologic/monkey-lang
$ monkey-lang
$ make
Removing monkey
Monkey v0.0.1 on Darwin
>>>

To run the tests run make test

Profiling

At the time of writing (06 January 2024) the VM that interprets Monkey bytecode is about as optimized as it can get without resorting to rewriting the virtual machine in another host language such as C or Rust.

Several profiling and benchmarking tools are provided:

Go Profiler

To run the Go Profiler and analyze CPU and Memory hotspot in the VM run the following which runs (by default) a Monkey Fibonacci program using fib(35) (by default) and produces cpu.prof, heap.prof and trace.out as outputs in the current directory for analysis:

$ go run profile.go

To pass a different program as input run:

go run profile.go </path/to/program.m>

To pass a different value for N (used as the program's first argument):

go run profile -n <N>

Thank to the wonderful work of Grafana Labs's Pyroscope analyzing and visualizing the CPU and Memory profiles is a breeze with the Flamegraph too.

Hyperfine

With the help of Hyperfine a wonderful command-line benchmarking tool writtein in Rust you can also compare branches, run a standalone benchmark and produce comparisions of Monkey against other languages.

To run a standalone benchmark:

$ ./bench.sh

To compre the current branch with master:

$ ./compare-branch.sh master

To run the benchmarks across a number of different langauges:

make compare

Examples

Hello World

Every programming language started here!

print("Hello World!")
Fibonacci
fib := fn(x) {
  if (x < 2) {
    return x
  }
  return fib(x-1) + fib(x-2)
}

println(fib(35))
FizzBuzz
test := fn(n) {
  if (n % 15 == 0) {
    return "FizzBuzz"
  } else if (n % 5 == 0) {
    return "Buzz"
  } else if (n % 3 == 0) {
    return "Fizz"
  } else {
    return str(n)
  }
}

n := 1
while (n <= 100) {
  println(test(n))
  n = n + 1
}

See examples for more example Monkey programs.

Embedding

Monkey can be embedded into your Go application by using it as a library. The git.mills.io/prologic/monkey-lang exposes the following public API:

  • ...

An example of embedding Monkey in your application could be:

package main

import (
	"log"

	"git.mills.io/prologic/monkey-lang"
)

const program = `println("Hello World!")`

func main() {
	if err := monkey.ExecString(program, false, false); err != nil {
		log.Fatal("error running program")
	}
}

See embed.go for this example. Running this produces the following output:

$ go run examples/embed.go
Hello World!

For a full example have a look at main.go that makes up the monkey binary.

Performance

Money is a dynamic interpreted programming language that compiles source input into bytecode for the Monkey virtual machine (VM) to interpret. Therefore Monekey has all of the performance characterises of a typical programming language typically referred to as a "scripting language" or interpreted language. Monkey does not compile to native code or produce native binaries.

The following is a snapshot of the Recursive Fibonacci program comparing the execution of fib(35) against a number of different languages (some of which are compiled and compile to native machine code and produce native binaries!):

Command Mean [ms] Min [ms] Max [ms] Relative
c 123.4 ± 2.4 119.1 126.3 1.00
go 215.0 ± 6.6 200.8 220.5 1.74 ± 0.06
python 1031.6 ± 2.5 1028.8 1037.3 8.36 ± 0.16
tauc 1092.3 ± 12.4 1083.0 1125.9 8.85 ± 0.20
tengo 1818.9 ± 5.9 1812.3 1828.9 14.74 ± 0.29
monkey 2365.1 ± 4.3 2356.9 2369.4 19.17 ± 0.37
taugo 2378.0 ± 15.8 2357.6 2407.9 19.28 ± 0.39

See Benchmark for up-to-date benchmarks and links to the languages compared with.

Syntax

The syntax of Money is a mix between Go and Python and should be familiar to most programmers. Monkey is a multi-paradigm dynamic programming language supporting object oriented, functional and imperative programming styles.

Programs

A Monkey program is simply zero or more statements. Statements don't actually have to be separated by newlines, only by white space. The following is a valid program (but you'd probably use newlines in theif block in real life):

>>> s := "world"
>>> println("Hello " + s)
Hello world
>>> if (s != "") { t := "The end" println(t) }
The end
>>>

Between tokens, white space and comments (lines starting with // or # through to the end of a line) are ignored.

Types

Monkey has the following data types: null, bool, int, str, array, hash, and fn. The int type is a signed 64-bit integer, strings are immutable arrays of bytes, arrays are grow-able arrays (use the append() builtin), and hashes are unordered hash maps. Trailing commas are NOT allowed after the last element in an array or hash:

Type Syntax Comments
null null
bool true false
int 0 42 1234 -5 -5 is actually 5 with unary -
str "" "foo" "\"quotes\" and a\nline break" Escapes: \" \\ \t \r \n \t \xXX
array [] [1, 2] [1, 2, 3]
hash {} {"a": 1} {"a": 1, "b": 2}
Variable Bindings
>>: a := 10
Arithmetic Expressions
>>> a := 10
>>> b := a * 2
>>> (a + b) / 2 - 3
12
Conditional Expressions

Monkey supports if and else:

>>> a := 10
>>> b := a * 2
>>> c := if (b > a) { 99 } else { 100 }
>>> c
99

Monkey also supports else if:

>>> test := fn(n) { if (n % 15 == 0) { return "FizzBuzz" } else if (n % 5 == 0) { return "Buzz" } else if (n % 3 == 0) { return "Fizz" } else { return str(n) } }
>>: test(1)
"1"
>>: test(3)
"Fizz"
>>: test(5)
"Buzz"
>>> test(15)
"FizzBuzz"
While Loops

Monkey supports only one looping construct, the while loop:

>>> while (i > 0) {
... println(i)
... i = i - 1
... }
...
3
2
1

Monkey does not have break or continue, but you can return <value> as one way of breaking out of a loop early inside a function.

Functions and Closures

You can define named or anonymous functions, including functions inside functions that reference outer variables (closures).

>>> multiply := fn(x, y) { x * y }
>>> multiply(50 / 2, 1 * 2)
50
>>> fn(x) { x + 10 }(10)
20
>>> newAdder := fn(x) { fn(y) { x + y } }
>>> addTwo := newAdder(2)
>>> addTwo(3)
5
>>> sub := fn(a, b) { a - b }
>>> applyFunc := fn(a, b, func) { func(a, b) }
>>> applyFunc(10, 2, sub)
8

NOTE: You cannot have a "bare return" -- it requires a return value. So if you don't want to return anything (functions always return at least null anyway), just say return null.

Recursive Functions

Monkey also supports recursive functions including recursive functions defined in the scope of another function (self-recursion).

>>> wrapper := fn() { inner := fn(x) { if (x == 0) { return 2 } else { return inner(x - 1) } } return inner(1) }
>>> wrapper()
2

Monkey also does tail call optimization and turns recursive tail-calls into iteration.

>>> fib := fn(n, a, b) { if (n == 0) { return a } if (n == 1) { return b } return fib(n - 1, b, a + b) }
>>> fib(35, 0, 1)
9227465
Strings
>>> makeGreeter := fn(greeting) { fn(name) { greeting + " " + name + "!" } }
>>> hello := makeGreeter("Hello")
>>> hello("skatsuta")
"Hello skatsuta!"
Arrays
>>> myArray := ["Thorsten", "Ball", 28, fn(x) { x * x }]
>>> myArray[0]
"Thorsten"
>>> myArray[4 - 2]
28
>>> myArray[3](2)
4
Hashes
>>> myHash := {"name": "Jimmy", "age": 72, true: "yes, a boolean", 99: "correct, an integer"}
>>> myHash["name"]
"Jimmy"
>>> myHash["age"]
72
>>> myHash[true]
"yes, a boolean"
>>: myHash[99]
"correct, an integer"
Assignment Expressions

Assignment can assign to a name, an array element by index, or a hash value by key. When assigning to a name (variable), it always assigns to the scope the variable was defined .

To help with object-oriented programming, obj.foo = bar is syntactic sugar for obj["foo"] = bar. They're exactly equivalent.

>>> i := 1
>>> mutate := fn() {
... i = 2
... println(i)
... }
...
2>>> println(i)
2
>>> mutate()
2
>>> println(i)
2
>>> map = {"a": 1}
>>> mutate := fn() {
... map.a = 2
... println(map.a)
... }
...
>>> println(map.a)
>>> 1
>>> mutate()
>>> 2
>>> println(map.a)
>>> 2
>>> lst := [0, 1, 2]
>>> lst[1] = "one"
>>> println(lst)
[0, "one", 2]
>>> map = {"a": 1, "b": 2}
>>> map["a"] = 3
>>> map.c = 4
>>> println(map)
{"a": 3, "b": 2, "c": 4}
Binary and unary operators

Monkey supports pretty standard binary and unary operators. Here they are with their precedence, from highest to lowest (operators of the same precedence evaluate left to right):

Operators Description
[] obj.keu Subscript
- Unary minus
* / % Multiplication, Division, Modulo
+ - Addition, Subtraction
< <= > >= in Comparison
== != Equality
<< >> Bit Shift
~ Bitwise not
& Bitwise and
| Bitwise or
|| Logical or (short-circuit)
&& Logical and (short-circuit)
! Logical not

Several of the operators are overloaded. Here are the types they can operate on:

Operator Types Action
[] str[int] fetch nth byte of str (0-based)
[] array[int] fetch nth element of array (0-based)
[] hash[str] fetch hash value by key str
- int negate int
* int * int multiply ints
* str * int repeat str n times
* int * str repeat str n times
* array * int repeat array n times, give new array
* int * array repeat array n times, give new array
/ int / int divide ints, truncated
% int % int divide ints, give remainder
+ int + int add ints
+ str + str concatenate strs, give new string
+ array + array concatenate arrays, give new array
+ hash + hash merge hashes into new hash, keys in right hash win
- int - int subtract ints
< int < int true iff left < right
< str < str true iff left < right (lexicographical)
< array < array true iff left < right (lexicographical, recursive)
<= > >= same as < similar to <
<< int << int Shift left by n bits
>> int >> int Shift right by n bits
== any == any deep equality (always false if different type)
!= any != any true iif left does not equal right
| int | int Bitwise or
& int & int Bitwise and
~ ~int Bitwise not (1's complement)
|| bool || bool true iff either true, right not evaluated if left true
&& bool && bool true iff both true, right not evaluated if left false
! !bool inverse of bool
Builtin functions
  • len(iterable) Returns the length of the iterable (str, array or hash).
  • input([prompt]) Reads a line from standard input optionally printing prompt.
  • print(value...) Prints the value(s) to standard output.
  • println(value...) Prints the value(s) to standard output followed by a newline.
  • first(array) Returns the first element of the array.
  • last(array) Returns the last element of the array.
  • rest(array) Returns a new array with the first element of array removed.
  • push(array, value) Returns a new array with value pushed onto the end of array.
  • pop(array) Returns the last value of the array or null if empty.
  • exit([status]) Exits the program immediately with the optional status or 0.
  • assert(expr, [msg]) Exits the program immediately with a non-zero status if expr is false optionally displaying msg to standard error.
  • bool(value) Converts value to a bool. If value is bool returns the value directly. Returns true for non-zero int(s), false otherwise. Returns true for non-empty str, array and hash values. Returns true for all other values except null which always returns false.
  • int(value) Converts decimal value str to int. If value is invalid returns null. If valueis anint` returns its value directly.
  • str(value) Returns the string representation of value: null for null, true or false for bool, decimal for int (eg: 1234), the string itself for str (not quoted), the Monkey representation for array and hash (eg: [1, 2] and {"a": 1} with keys sorted), and something like <fn name(...) at 0x...> for functions..
  • type(value) Returns a str denoting the type of value: nil, bool, int, str, array, hash, or fn.
  • args() Returns an array of command-line options passed to the program.
  • lower(str) Returns a lowercased version of str.
  • upper(str) Returns an uppercased version of str.
  • join(array, sep) Concatenates strs in array to form a single str, with the separator str between each element.
  • split(str[, sep]) Splits the str using given separator sep, and returns the parts (excluding the separator) as an array. If sep is not given or null, it splits on whitespace.
  • find(haystack, needle) Returns the index of needle strinhaystack str, or the index of needleelement inhaystack` array. Returns -1 if not found.
  • readfile(filename) Reads the contents of the file filename and returns it as a str.
  • writefile(filename, data) Writes data to a file filename.
  • abs(n) Returns the absolute value of the n.
  • pow(x, y)Returnsxto the power ofyasint`(s).
  • divmod(a, b) Returns an array containing the quotient and remainder of a and b as int(s). Equivilent to [a / b, b % b].
  • bin(n) Returns the binary representation of n as a str.
  • hex(n) Returns the hexidecimal representation of n as a str.
  • oct(n) Returns the octal representation of n as a str.
  • ord(c) Returns the ordincal value of the character c as an int.
  • chr(n) Returns the character value of n as a str.
  • hash(any) Returns the hash value of any as an int.
  • id(any) Returns the identity of any as an int.
  • min(array) Returns the minimum value of elements in array.
  • max(array) Returns the maximum value of elements in array.
  • sorted(array) Sorts the array using a stable sort, and returns a new array.. Elements in the array must be orderable with < (int, str, or array of those).
  • reversed(array) Reverses the array array and returns a new array.
  • open(filename[, mode])
  • write(fd, data) Writes str data to the open file descriptor given by int fd.
  • read(fd, [n]) Reads from the file descriptor fd (int) optinoally up to n (int) bytes and returns the read data as a str.
  • close(fd) Closes the open file descriptor given by fd (int).
  • seek(fd, offset[, whence]) Seeks the file descriptor fd (int) to the offset (int). The optional whence (int) determins whether to seek from the beginning of the file (0), relativie to the current offset (1) or the end of the file (2).
  • socket(type) Creates a socket with the given type, Valid types are unix, tcp4, tcp6. Example: fd := socket("tcp4")`
  • bind(fd, address) Binds the socket fd to the address. Example: bind(fd, "0.0.0.0:8000")
  • listen(fd, backlog) Sets the socket fd to lstein for new connections with the given backlog. Example: `listen(fd, 1)
  • accept(fd) Accepts a new incoming client connection from the socket fd. Example: c := accept(fd)
  • connect(fd, address) Creates a new connection with the socket fd to the given address. Example: connect(fd, "127.0.0.1:8000")
Objects
>>> Person := fn(name, age) { self := {} self.name = name self.age = age self.str = fn() { return self.name + ", aged " + str(self.age) } return self }
>>> p := Person("John", 35)
>>> p.str()
"John, aged 35"
Modules

Monkey supports modules. Modules are just like other Monkey source files with the extension .m. Modules are searched for by SearchPaths which can be controlled by the environment MONKEYPATH. By default this is always the current directory.

To import a module:

>>> foo := import("foo")
>>> foo.A
5
>>> foo.Sum(2, 3)
5

License

This work is licensed under the terms of the MIT License.

Documentation

Overview

Package monkey provides a virtual machine for executing Monkey programs.

Index

Constants

View Source
const MonkeyVersion = "v1.3.6"

MonkeyVersion is the version number for the monkey language virtual machine.

Variables

This section is empty.

Functions

func CompileFiles

func CompileFiles(fns []string, opts *Options) error

CompileFiles compiles multiple Monkey files and returns any errors encountered during compilation.

func ExecFile

func ExecFile(fn string, opts *Options) error

ExecFile executes a Monkey program from a file on disk.

func ExecString

func ExecString(input string, opts *Options) error

ExecString executes a Monkey program from a string.

func PrintVersionInfo

func PrintVersionInfo(w io.Writer)

PrintVersionInfo prints information about the current version of the monkey virtual machine to the given writer.

func REPL

func REPL(args []string, opts *Options) error

REPL provides a read-eval-print loop for the monkey virtual machine.

func SimpleREPL

func SimpleREPL(args []string, opts *Options)

SimpleREPL provides a simple read-eval-print loop for the monkey virtual machine.

Types

type Options

type Options struct {
	Debug bool
	Trace bool

	Args   []string
	Stdin  io.Reader
	Stdout io.Writer
	Stderr io.Writer
	Exit   func(int)
}

func (Options) ToVMOptions

func (opts Options) ToVMOptions() []vm.Option

Directories

Path Synopsis
cmd
monkey
Package main is the main entrypoint for the monkey interpreter
Package main is the main entrypoint for the monkey interpreter
internal
ast
eval
Package eval implements the evaluator -- a tree-walker implemtnation that recursively walks the parsed AST (abstract syntax tree) and evaluates the nodes according to their semantic meaning
Package eval implements the evaluator -- a tree-walker implemtnation that recursively walks the parsed AST (abstract syntax tree) and evaluates the nodes according to their semantic meaning
parser
Package parser implements the parser and produces an AST from source code.
Package parser implements the parser and produces an AST from source code.
server
Package server implements the Monkey Lang Web Server that implements a web-based Playground for testing out and trying Monkey on the Web.
Package server implements the Monkey Lang Web Server that implements a web-based Playground for testing out and trying Monkey on the Web.
vm
Package vm implements our virtual machine which is passed a sequence of bytecode instructions to execute which has been parsed and compiled by the lexer/parser and compiler in previous steps
Package vm implements our virtual machine which is passed a sequence of bytecode instructions to execute which has been parsed and compiled by the lexer/parser and compiler in previous steps

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL