# POOL – Drafted schedule and other random notes

The following is a short and drafted schedule for the POOL project, it doesn’t contain any dates and should only give an idea, what I’m going to do next in the project and what I’ve already done.

## Almost done

• Create a draft of the syntax (I’ve to admit that I’m currently working on the class syntax and on the variable container syntax)

## TODO

• Publish the draft
• Figure out the core libraries (like System, etc.)
• Parser grammar, which produces the AST
• Tree filters to optimize and annotate the AST (convert for example 2+3 to 5)
• Tree based interpreter
• Objects, scope, functions, etc.
• Tree based interpretation
• Optimization of the interpreter
• More built in libraries
• Language manual with lot’s of example code and a website as I think the project will (after creating a tree based interpreter) more than half a year old.
• Byte code based interpreter aka Virtual Machine
• Byte code compiler
• Byte code interpreter aka VM

# POOL – Fibonnaci sequence

I’m going to post some example code snippets, like the following, written in POOL to demonstrate some of POOLs cool features and to have some test code when I’m writing the parser and the interpreter.

This code snippet eveluates the fibonacci sequence recursively, using the memoizing features of the special function type `sef_function` to avoid on the usual drawbacks of recursive evaluation: the multiple calculation of the same value.

``` sef_function fibonacci(n){ fibonacci(n - 1) + fibonacci(n - 2) } fibonacci(0) = 0 fibonnaci(1) = 1```
``` fibonacci(5) #-> 5 /* Call stack of fibonacci(5): fibonacci(5) -> fibonacci(4) + fibonacci(3) -> (fibonacci(3) + fibonacci(2)) + fibonacci(3) -> ((fibonacci(2) + fibonacci(1)) + fibonacci(2)) + fibonacci(3) -> (((fibonacci(1) + fibonacci(0)) + fibonacci(1)) + fibonacci(2)) + fibonacci(3) -> (((1 + 0) + 1) + fibonacci(2)) + fibonacci(3) -> ((1 + 1) + 1) + fibonacci(3) -> (2 + 1) + 2 -> 3 + 2 -> 5 */ ```