schmu
Cwerg
schmu | Cwerg | |
---|---|---|
3 | 59 | |
24 | 398 | |
- | - | |
9.5 | 9.6 | |
2 days ago | 6 days ago | |
OCaml | Python | |
European Union Public License 1.2 | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
schmu
-
November 2022 monthly "What are you working on?" thread
Since the last time I posted, I finished implementing pattern matching for schmu. To make matching on multiple columns less confusing I also added a tuple syntax to the language (finally), which are treated as anonymous records in codegen. Since then, I'm trying to overhaul my memory management, as my RAII-like solution only worked for linear code. In my first big departure from OCaml semantics, I decided to implement mutable value semantics. The paper linked in the Val language introduction makes a strong case for value semantics and after watching a couple of talks by Dave Abrahams, I wanted to try see how it feels. By making mutability be transitive and explicit, it also fixes one of the (few) gripes I have with OCaml that an array can never be really const as it is a reference type (it's possible to enforce constness with modules, but that's not exactly lightweight, syntax wise). Implementing mutable value semantics was pretty straight forward on the typing side, but I'm still not completely done with the codegen. This is due to 1. Assumptions about immutability I made in a lot of places are now wrong, and I had to completely change the way I pass values to functions. 2. I had to implement reference counted arrays, which was more work than I thought it would be. There are still edge-cases coming up in testing from time to time. Yesterday I finally managed it work for tail recursion, yay! I'm looking forward to getting rid of unneeded reference count updates in the future, by moving them to compile time, at least for linear code, lobster style. That's also an excuse to read that Perceus paper again. For the rest of November, I want to enhance my module system a bit. In particular, I want to add signatures and allow locally abstract types. I hope to have this in place before December to do the Advent of Code in my language.
-
September 2022 monthly "What are you working on?" thread
I'm still working on my toy language schmu, an ML-inspired language which uses LLVM as backend.
-
May 2022 monthly "What are you working on?" thread
I spent the time off over the Easter break to write the first program in my language which is not an explicit test and ended up implementing Ray Tracing In One Weekend. It was very rewarding to see how usable the language is already.
Cwerg
-
Cwerg: C-like language that can be implemented in 10kLOC
Perhaps these have already been dealt with and I'm missing critical information. If so, my apologies. Great work, in any case.
[1] https://github.com/robertmuth/Cwerg/tree/master/FrontEnd#dis...
-
Where can I find resources and guides on how to build compiler backends?
Cwerg has backend that can be used as JIT and is written with readability in mind. Additional documentation can be found here: https://github.com/robertmuth/Cwerg/tree/master/Docs
- Most important language features not touched in the book "Crafting Interpreters"?
- Lack of resources in creating Assemblers from scratch.
-
Minimum ISA Capabilities to Support Most (Non-Interactive) Programs?
I defined a basic ISA-like IR for Cwerg. It has unlimited registers and no constraints on immediates.
-
How do you design a compiler and a language?
entire compiler front end ast nodes
-
Syntax Design
I was also going down the path of bike shedding concrete syntax for my language Cwerg before pulling the plug on that effort and just using s-exprs. I managed to make the s-expr quite succinct by carefully choosing the order of arguments so I can omit optional ones. Also very helpful was to use square brackets for list, e.g. (call fun-name [arg1 arg2]). This simplifies parsing a little bit and is easier on the eye. Here are some Code Examples
-
November 2022 monthly "What are you working on?" thread
I am iterating over the languages features for Cwerg's Frontend which aims to be a low level language with about the complexity of C but with some of the comforts of modern languages. I am especially happy with the choice of adding sum types. Relative to C the current feature set looks like this: Removed: * arrays decay to pointers * bitfields * separate compilation (more of a backend issue) * pre-processor * varargs * implcit type conversions * (untagged) unions * ++/-- * comma operator * implicitly nullable pointers * goto
- typed asts and codegen
- Features Compendium
What are some alternatives?
Forscape - Scientific computing language
mir - A lightweight JIT compiler based on MIR (Medium Internal Representation) and C11 JIT compiler and interpreter based on MIR
vult - Vult is a transcompiler well suited to write high-performance DSP code
tinycc - Unofficial mirror of mob development branch
GLhf - OpenGL Application Abstraction
asmjit - Low-latency machine code generation
peridot - A fast functional language based on two level type theory
bluebird - A work-in-progess programming language modeled after Ada and C++
awesome-low-level-programming-languages - A curated list of low level programming languages (i.e. suitable for OS and game programming)
asmdb - Instructions database and utilities for X86/X64 and ARM (THUMB/A32/A64) architectures.
creed-tui - A tui editor with creed integration. WIP
boring-lang - A very boring programming language