HAVM is a virtual machine designed to execute simple register based high level intermediate code. It is based on the intermediate representations ("canonicalized" or not) defined by Andrew Appel in his Modern Compiler Implementation books. It is nevertheless generic enough so that any (student) compiler could target its intermediate language to HAVM's language.
Its features are:
- two object types, integers and pointers
- tree-like source language (two way conditional jumps, arbitrarily nested subroutines calls, etc.)
- threaded source language (one way conditional jumps, etc.)
- a runtime library comparable to SPIM's
- a debugging mode displaying the instructions being executed
It was written by Robert Anisko as an LRDE member, so that EPITA students could exercise their [[Tiger.WebHome][Tiger]] compiler projects before the final jump to assembly code. It is implemented in Haskell, a pure non strict functional language very well suited for this kind of symbolic processing. HAVM was coined on both Haskell and VM, standing for Virtual Machine.
- Version 0.26: https://www.lrde.epita.fr/~tiger/download/havm-0.26.tar.bz2
- Version 0.25: https://www.lrde.epita.fr/~tiger/download/havm-0.25.tar.bz2
- The Git repository is located at https://gitlab.lrde.epita.fr/tiger/havm.git.
- You can browse it online via Gitlab.
- See HAVM's documentation at https://www.lrde.epita.fr/~tiger/doc/:
Send any questions or comments to firstname.lastname@example.org.