TinyVM example

gistfile1.txt

// R08 stores a pointer to top of the heap

// a function with two parameters (lists of pointers)
// R09 stores the flag
// R10 stores a pointer to the current node in the heap
// R11 stores:
//   * a pointer to the list of parameters
//   * the return value

f:
  [popf R09]
  [pop R11]
  // ...
  // smash current node in heap pointed to by R10
  // deallocate list at R11
  // store the return value in R11
  [push R11]


// ...
// push a pointer to the list of parameters
[pushf]
[call f]
// pop the return value






// the heap is a tree where each node contains:
//   * pointer to parent
//   * pointer to list of children
//   * pointer to hash (pointer to string, pointer to value) of variables