litte bit of docs
This commit is contained in:
parent
71ab369c71
commit
f993ccefe3
@ -9,8 +9,9 @@ And a large part of that functionality must actually be used at compile time too
|
||||
We reuse the Parfait code at compile-time, to create the data for the compiled code.
|
||||
To do this the compiler (re) defines the object memory (in parfait_adapter).
|
||||
|
||||
A work in progress that started from here : http://ruby-x.org/2014/06/10/more-clarity.html
|
||||
went on here http://ruby-x.org/2014/07/05/layers-vs-passes.html
|
||||
A work in progress that started from here : http://ruby-x.org/blog/more-clarity
|
||||
went on here http://ruby-x.org/blog/layers-vs-passes.html
|
||||
and is now documented here http://ruby-x.org/rubyx/parfait.html
|
||||
|
||||
A step back: the code (program) we compile runs at run - time.
|
||||
And so does parfait. So all we have to do is compile it with the program.
|
||||
|
@ -9,7 +9,7 @@ Our primary objective is to compile typed code to this level, so the register ma
|
||||
- object load
|
||||
- object oriented call semantics
|
||||
- extended (and extensible) branching
|
||||
- normal integer operators (but no sub word instructions)
|
||||
- normal integer operators
|
||||
|
||||
All data is in objects.
|
||||
|
||||
@ -30,7 +30,7 @@ the meaning or number of syscalls. This is implemented by the level below, eg th
|
||||
|
||||
## Interpreter
|
||||
|
||||
There is an interpreter that can interpret compiled register machine programs.
|
||||
There is an interpreter that can interpret programs compiled to the risc instruction set.
|
||||
This is very handy for debugging (and nothing else).
|
||||
|
||||
Even more handy is the graphical interface for the interpreter, which is in it's own repository:
|
||||
|
Loading…
Reference in New Issue
Block a user