codespan VS starlark-rust

There's https://github.com/brendanzab/codespan as well, and a number linked from their pages.

Working in a GENERAL relational language (ie: not just a query one, like SQL, but general to make full apps, like python/delphi/c# + linq):

https://tablam.org

that is my attempt to resurrect the spirit of the FoxPro/dbase kind of tools.

Is on Rust, and is also my way to sharp my skills on it.

Now, I'm in the process of improve the parsing to be robust like in Rust, so i can show good error messages:

https://github.com/brendanzab/codespan

and also, hopefully, implement a solid type inference that work fine with the challenge of infer joins like "customer CROSS JOIN address".

---

The idea, long-term, is create a tool alike MS Access/FoxPro+Excel that I think could be great for a lot of companies (that are using stuff like "BigData" tools -like hadoop- when them are struggling with more fundamental issues!) and improve the condition of make business apps/analysis.

I already hear some interest when the vision is described in full, and I certain any company that use Excel/Access to deal with data and/or make business apps is anemically served by it.

The alternatives now are only for the cloud, and I instead wanna a local-first/on-premise offering...

Nice error messages (for YOUR lang) https://github.com/brendanzab/codespan or https://docs.rs/ariadne/0.1.3/ariadne/

I haven't seen anyone mention starlark yet. It's something I want to play with as a config language.

Aside from these, if you want some inspiration for a production-grade language built in Rust, you might want to go through the source code of Starlark and Gluon.

There is also a Rust implementation of Starlark as a starting point https://github.com/facebookexperimental/starlark-rust

To add to everyone else, please don't use YAML. Starlark is great _precisely_ because it is a readable, well known (nearly Python) language that is limited at the same time (no unbounded for loops, no way to do non-deterministic things like get the current time or `random()`).

This is a follow-up to Benchmarking mlua/rlua/rhai - Rust embedded scripting languages from 4mo ago; I just added the new Starlark implementation from Meta to the benchmark posted by @aleksru.

The Rust implementation has it as an experimental extension (https://github.com/facebookexperimental/starlark-rust/blob/m...)

u/ndmitchell has been working on a Starlark interpreter. He wrote up a blog post with some thoughts about different interpreter styles. He found that in his case using fixed sized instructions was about the same as byte-encoded ones, but compiling the AST to closures was also about the same performance as well, and doesn't need an AST->bytecode compiler.

As mentioned in other comments, type system features like algebraic data types (that Rust has) are really helpful. If you want a small-but-real example of a compiler in Rust (with an optimizer etc) then the starlark-rust compiler is good.

If your Rust program needs a more complicated configuration (conditionals, access to APIs and so on), also look at Facebook's Starlark parser and tooling[1]. Starlark is a subset of Python used by Bazel, Buck and a few other projects.

[1]: https://github.com/facebookexperimental/starlark-rust

The Facebook post gives a nice overview. It also links out to the home page for the project at https://github.com/facebookexperimental/starlark-rust/, which has an introduction and links to what Starlark is, the crates.io link, the docs.rs link etc.