about summary refs log tree commit diff stats
path: root/subx/001help.cc
Commit message (Collapse)AuthorAgeFilesLines
* 4289 - beginnings of a translator to ELFKartik Agaram2018-06-301-3/+2
| | | | | The source 'language' is still entirely open. We'll see how it evolves as I write programs in machine code.
* 4277 - make room for a 'compile' sub-commandKartik Agaram2018-06-271-1/+3
|
* 4276 - switching gears to subxKartik Agaram2018-06-271-1/+4
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | New plan: spend some time learning to program in machine code atop subx, relying solely on a tiny subset of kernel-provided syscalls. Gradually introduce helpers. Helpers we're sure we don't need, so far: a) Nested expressions b) Garbage collection c) One-size-fits-all memory allocation primitive d) Function overloading and generics Helpers we're sure we need, so far: a) Dependency-injected versions of syscalls b) Tangling directives c) Statically checked types Workflow for a C translator from ascii to binary: a) run generated machine code atop subx (unit tests probably go here) b) emit machine code packaged as an ELF file c) check that the ELF binary runs natively d) check that the ELF binary can be unwrapped and run atop subx This is different from a conventional compiler because the 'HLL' is unconstrained. It is also different from Forth given the emphasis on types. We want a simple stack that also encourages code sharing between programmers. Conventional languages grow monotonically complex. Forth discourages code sharing; it is non-trivial to figure out the 'shape' of data a strange function expects on the stack.
* 4063Kartik K. Agaram2017-10-141-2/+2
|
* 4014 - core skeleton for x86 interpreterKartik K. Agaram2017-10-111-16/+4
|
* 4011 - start of sub-x86 VMKartik K. Agaram2017-10-091-2/+2
|
* 3930 - experimental bytecode interpreterKartik K. Agaram2017-06-191-0/+220