Ecosystems:
OCaml
Bot releases are visible (Hide)
You will have your extremely first experience about compilation, the language we supported here is:
x ; variable
i ; integer
e ::=
| x
| i
| (+ e1 e2)
| (- e1 e2)
| (let ((x e1)) e2)
There have 8 passes.
- uniquify
- remove complex operands
- explicate control
- select instruction
- liveness analysis
- conflict graph inference
- register allocation
- Due to AArch64 stack operations, we add patch stack operations
Run example
To run example, use the following command:
dune exec minic -- ./example/hello.ss
There have three examples in this stage.
- hello.ss
- rco_example.ss
- conflict_graph_sample.ss
Bonus: any length of input
This implementation can only take (+ e1 e2) and (- e1 e2), but in Racket(another scheme variant) we can have
-
(+)which produces0 -
(+ e1 e2 e3 ...)which sums all -
(- e1 e2 e3 ...)which recursively subtract(- e1 e2)then put result as head of subtraction then again, e.g.(- 6 3 2)is1, not5
Can you implement them?
Note
For subtract, this bonus disallow(- e), which is valid in Racket.
Bonus: move biasing
Remove the instruction like mov a, a, this is completely useless but can occur after register allocation.