sligh VS pest

But, you still seem hung up on this, so here’s actual code: https://github.com/amw-zero/sligh/blob/main/lib/codegen.ml.

Of course. Here was the first incarnation: https://github.com/amw-zero/sligh. It has a decent overview of the idea in the readme. To sum it up here, the idea is: have a language built around model-driven development and model-based testing, where you write a simple model of an application, and the implementation and model-based tests are compiled for you. I wrote about the overall model-based testing strategy here. This idea comes from self-certifying compilers that produce proofs of their correctness such as Cogent, but we drop the formality requirement and use property-based testing to compare the implementation and model.

Honorable mention - I’m working on a language with similar goals: Sligh, and I’ve written about why I think it’s such a compelling idea before as well too.

In Sligh, I spent most of the last month introducing a new intermediate representation to make tier splitting (choosing if code should live on the client or server) easier. My goal was to enable derived data, as in a model that queries other models for its data and combines them by processing them in memory. I've been using the example of a personal finance application, so imagine:

The language that I work on is Sligh, and it's out of the bulleted list because it's nowhere near as mature as any of those that I listed, and I'm more of a verification enthusiast vs. expert. Almost all of the ideas in it are borrowed from somewhere else, but I think the one quasi-unique idea is it allows you to write a pure logical description / specification of an application, and it generates full-stack web application code from that.

I’m currently using Pest, though I wouldn’t exactly recommend my compiler as a ‘good example’ just yet because I’m prototyping and just churning code out.

Sligh

So tactically it’s currently a source-to-source compiler, where in the source language (my language) you denote the system state transitions, i.e. by writing create!, update!, etc, and those get compiled to corresponding client and server code in the target language (JS for now, but hoping to support WebAssembly in the future). Heres an example program. The compiler source is there too. I’m hacking it together right now, so it’s not my finest work :D

And some related parser tools: - https://github.com/kevinmehall/rust-peg - https://github.com/pest-parser/pest - https://github.com/lalrpop/lalrpop

I had recently completed the first year of my Computer Science class at school and will begin my second year soon. My schools' class forces the use of Java programming language, and I absolutely hated it. So, over the course of a little less than a month, I wrote my own programming language, in Rust (objectively best programming language), using pest, to be as similar to Rust as possible, but compiling to Java.

I second pest.rs. Using it is fairly intuitive and there's also a live playground on their website which is great for quickly developing and testing your AST (abstract syntax tree) parser for whatever language you're implementing.

This is where you'll run into trouble. People who write parsing-related Rust crates generally write things like pest that expect their syntax to be defined completely at compile time so the parser can be run through the compiler's optimizers for best performance.

Give https://pest.rs a try.

For now I have used pest to generate an AST that borrows from the given input. But if I can manage to make the parser generic over the return type it may be worth a refactoring.