25 lines
1.5 KiB
Plaintext
25 lines
1.5 KiB
Plaintext
|
%p Both “ends”, parsing and machine code, were relatively clear cut. Now it is into unknown territory.
|
|||
|
|
%p I had ported the Kaleidoscope llvm tutorial language to ruby-llvm last year, so thee were some ideas floating.
|
|||
|
|
%p
|
|||
|
|
The idea of basic blocks, as the smallest unit of code without branches was pretty clear. Using those as jump
|
|||
|
|
targets was also straight forward. But how to get from the AST to arm Intructions was not, and took some trying out.
|
|||
|
|
%p
|
|||
|
|
In the end, or rather now, it is the AST layer that “compiles” itself into the Vm layer. The Vm layer then assembles
|
|||
|
|
itself into Instructions.
|
|||
|
|
%p
|
|||
|
|
General instructions are part of the Vm layer, but the code picks up derived classes and thus makes machine
|
|||
|
|
dependent code possible. So far so ok.
|
|||
|
|
%p
|
|||
|
|
Register allocation was (and is) another story. Argument passing and local variables do work now, but there is definitely
|
|||
|
|
room for improvement there.
|
|||
|
|
%p
|
|||
|
|
To get anything out of a running program i had to implement putstring (easy) and putint (difficult). Surprisingly
|
|||
|
|
division is not easy and when pinned to 10 (divide by 10) quite strange. Still it works. While i was at writing
|
|||
|
|
assembler i found a fibonachi in 10 or so instructions.
|
|||
|
|
%p
|
|||
|
|
To summarise, function definition and calling (including recursion) works.
|
|||
|
|
If and and while structures work and also some operators and now it’s easy to add more.
|
|||
|
|
%p
|
|||
|
|
So we have a Fibonacchi in ruby using a while implementation that can be executed by salama and outputs the
|
|||
|
|
correct result. After a total of 7 weeks this is much more than expected!
|