about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
* 5787Kartik Agaram2019-12-026-18/+18
|
* 5786Kartik Agaram2019-11-304-2553/+2586
|
* 5785 - initial skeleton for parsing fn bodiesKartik Agaram2019-11-302-5/+21
| | | | | All tests passing again. We have big gaping holes for type- and var-management. We're going to work on the latter first.
* 5784Kartik Agaram2019-11-303-9/+27
| | | | | Lots of debugging to add two curly braces. I need tests for populate-mu-function-body, or even parse-mu-block.
* 5783Kartik Agaram2019-11-3015-2564/+3602
|
* 5782 - fix a widespread bug with Heap-sizeKartik Agaram2019-11-3029-15/+15
|
* 5781Kartik Agaram2019-11-302-3/+194
| | | | | parse-mu-stmt now working, though we'll need to go back and stop creating a new var for every instance of a variable in a scope.
* 5780Kartik Agaram2019-11-291-43/+50
|
* 5779Kartik Agaram2019-11-291-100/+308
| | | | | Snapshot with new skeleton for parsing function body. New test still failing, but only in the one expected place.
* 5778Kartik Agaram2019-11-2917-43/+43
|
* 5777Kartik Agaram2019-11-292-3/+159
|
* 5776Kartik Agaram2019-11-292-34/+48
|
* 5775Kartik Agaram2019-11-292-9/+105
|
* 5774Kartik Agaram2019-11-291-26/+82
| | | | Function headers seem to be parsing right.
* 5773Kartik Agaram2019-11-283-0/+206
| | | | Rudimentary support for parsing variable declarations.
* 5772Kartik Agaram2019-11-282-0/+110
|
* 5771Kartik Agaram2019-11-282-2161/+2558
|
* 5770Kartik Agaram2019-11-283-1/+190
|
* 5769 - support uppercase hex in SubXKartik Agaram2019-11-2816-233/+241
|
* 5768 - start parsing fn headersKartik Agaram2019-11-272-14/+63
|
* 5767Kartik Agaram2019-11-272-16/+175
| | | | Some groundwork for parsing.
* 5766Kartik Agaram2019-11-261-197/+299
|
* 5765Kartik Agaram2019-11-2613-3/+119
| | | | | | | | | A couple more primitives now working. In the process I ran into an issue with some buffer filling up when running ntranslate. Isolating it to survey.subx was straightforward, but --trace ran out of RAM, and --trace --dump ran out of (7GB of) disk. In the end what helped was just repeatedly inserting exits at different points, and I realized there was a magic number that hadn't been turned into a named constant.
* 5764Kartik Agaram2019-11-262-1/+8
|
* 5763Kartik Agaram2019-11-263-856/+950
|
* 5762Kartik Agaram2019-11-261-5/+0
|
* 5761Kartik Agaram2019-11-264-2102/+2273
|
* 5760Kartik Agaram2019-11-252-8/+31
|
* 5759 - design statement data structureKartik Agaram2019-11-251-14/+80
|
* 5758Kartik Agaram2019-11-251-5/+2
|
* 5757Kartik Agaram2019-11-182-14/+0
|
* 5756Kartik Agaram2019-11-183-994/+1030
|
* 5755Kartik Agaram2019-11-183-897/+1024
| | | | Support function calls with literal arguments.
* 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
|