about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
* 5754Kartik Agaram2019-11-183-1098/+1249
| | | | Support binary instructions with an immediate operand.
* 5753Kartik Agaram2019-11-187-1510/+1541
| | | | | | | | | Binaries are now identical again. There's a little hack here that we should clean up at some point. But it requires more thought. Ordering compiler phases is hard. So far we're only at the start of the slippery slope into that abyss.
* 5752Kartik Agaram2019-11-1818-1187/+1221
| | | | | | | Support binary operations with reg/mem and reg operands. Everything is passing. However, the self-hosting translator now generates some discrepancies compared to the C++ translator :(
* 5751 - start of table of Mu primitivesKartik Agaram2019-11-183-940/+1267
| | | | | So far this is just the same as our most recent tests. But now we have a 'DSL' for adding more primitives.
* 5750Kartik Agaram2019-11-173-465/+1227
| | | | | We can now compile primitive statements while selecting the right template to code-gen each one from. Even when multiple templates have the same name.
* 5749Kartik Agaram2019-11-171-1/+1
| | | | | Support running a single test when the current function around the cursor ends in '?'.
* 5748Kartik Agaram2019-11-162-0/+969
| | | | | | | | | | A new draft of docs as I build out mu.subx. Once we have the second Mu language, it makes sense to relegate most of the underlying SubX docs to a separate doc. I want each layer to be learned bottom-up as I've been organizing SubX so far. But it's counter-productive to require people to learn SubX before Mu.
* 5747Kartik Agaram2019-11-151-1023/+1317
|
* 5746Kartik Agaram2019-11-152-37/+336
| | | | | | | | | | | | | | | | After much struggle, one more test: emitting a primitive with a register operand. The following two instructions have the same name: reg <- increment increment var and they emit the same opcodes: ff 0/subop But they're considered distinct policies in the code-generation 'table', one for incrementing variables on the stack and the other for incrementing variables in a register.
* 5745Kartik Agaram2019-11-143-1073/+1139
| | | | | | I've been under-estimating the complexity of translating primitive statements. We need to separately track information for each primitive about operands for both the source and emitted SubX notation.
* 5744Kartik Agaram2019-11-141-9/+5
|
* 5743Kartik Agaram2019-11-142-1/+1
|
* 5742Kartik Agaram2019-11-141-7/+5
| | | | No, let's represent register as just a string to save a translation.
* 5741Kartik Agaram2019-11-143-1023/+1039
| | | | | Support variables at positive stack offsets (formal parameters for functions), and also an indicator for 'any register' for primitive operations.
* 5740Kartik Agaram2019-11-141-4/+0
|
* 5739Kartik Agaram2019-11-102-0/+8
| | | | Add mu.subx to CI.
* 5738Kartik Agaram2019-11-101-898/+1081
|
* 5737 - first 2 Mu statements translating to SubXKartik Agaram2019-11-101-15/+64
|
* 5736Kartik Agaram2019-11-101-47/+69
| | | | | | | | Rethink how vars are organized. We need separate aggregates for vars in the definition stack, defined in function headers, and used by statement operands. So now vars have no 'next' fields themselves. The definition stack will be a real stack, while the function headers and statement operands will have separate 'next' fields.
* 5735Kartik Agaram2019-11-091-17/+44
| | | | Switching gears to emitting function calls. The function name is working now.
* 5734Kartik Agaram2019-11-091-13/+49
| | | | No, we need to handle primitives and calls separately.
* 5733Kartik Agaram2019-11-091-11/+60
|
* 5732Kartik Agaram2019-11-092-1056/+1002
|
* 5731Kartik Agaram2019-11-092-921/+899
|
* 5730Kartik Agaram2019-11-091-606/+1028
|
* 5729Kartik Agaram2019-11-091-16/+155
| | | | Just a random snapshot of mu.subx. The two new tests aren't passing yet.
* 5728Kartik Agaram2019-11-081-7/+153
|
* 5727Kartik Agaram2019-11-081-6/+157
|
* 5726Kartik Agaram2019-11-032-12/+12
|
* 5725Kartik Agaram2019-10-304-388/+398
|
* 5724Kartik Agaram2019-10-292-536/+538
|
* 5723Kartik Agaram2019-10-292-1/+667
|
* 5722Kartik Agaram2019-10-291-0/+47
| | | | Already http://akkartik.name/post/mu-2019-2 is out of date.
* 5721Kartik Agaram2019-10-291-6/+11
|
* 5720 - start of Mu's eponymous level-2 languageKartik Agaram2019-10-291-0/+565
| | | | http://akkartik.name/post/mu-2019-2
* 5719Kartik Agaram2019-10-291-1/+1
|
* 5718Kartik Agaram2019-10-291-1/+1
|
* 5717Kartik Agaram2019-10-272-2/+2
|
* 5716Kartik Agaram2019-10-2630-19962/+19639
|
* 5715Kartik Agaram2019-10-2610-44/+39
| | | | | | | Clean up pseudocode to match planned syntax for the type- and memory-safe level-2 Mu language. http://akkartik.name/post/mu-2019-2 is already out of date.
* 5714Kartik Agaram2019-10-2537-771/+379
| | | | Replace calculations of constants with labels.
* 5713Kartik Agaram2019-10-231-2/+2
|
* Merge pull request #41 from tekknolagi/mb-rewrite-loopKartik Agaram2019-10-221-3/+2
|\ | | | | Simplify loop
| * Simplify loopMax Bernstein2019-10-221-3/+2
| |
* | Merge pull request #40 from tekknolagi/masterKartik Agaram2019-10-221-1/+3
|\ \ | |/ |/| Raise an error if too few arguments are provided
| * Raise an error if too few arguments are providedMax Bernstein2019-10-221-1/+3
|/ | | | This is a notably better user experience than an assert failing.
* 5708Kartik Agaram2019-10-192-2/+2
|
* 5707Kartik Agaram2019-10-196-266/+290
|
* 5706 - example at different levels of syntax sugarKartik Agaram2019-10-196-0/+740
| | | | | Thanks Mateusz Czapliński for the feedback: https://lobste.rs/s/xtxlec/mu_minimal_hobbyist_computing_stack#c_1mzq94
* 5705Kartik Agaram2019-10-191-5/+9
|
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-11-18 11:49:22 +0000