Charm-MacOS VS tailspin-v0

There's source code here, a Mac executable with auxiliary files here, and there's a manual here which also has notes in pink to explain the reasoning behind my choices. If you like the project, please add a star to the source code repo. Thanks!

There is a manual here with extensive notes (in pink) for langdevs. The source code is here and Mac OS object code can be found here.

Source code; Mac OS object code; manual.

So, here's the source code, and here's the Mac executable plus resource files. Both come with lots of example code and a manual in .pdf form with extensive notes for langdevs. The description of the bells and whistles of the REPL are near the end of the manual, in the section titled "The hub".

Here's the source code etc, here's a compiled Mac OS version, and here's a manual with extensive notes for other langdevs about what I'm trying to do.

Mac OS object code for Charm : https://github.com/tim-hardcastle/Charm-MacOS

See my shiny newish language paradigm! Or, alternatively, come and stare at the crazy guy trying to put the fun into functional! (Mac executable, manual in .pdf form and demo code here, source code etc here. Or if you just want to read about it without getting your hands dirty, here’s a version of the manual with extensive notes for langdevs.)

I eventually tend to do all days in Tailspin. The ones I have done so far are in directories ending in "tt" (the others are in Pyret, just to get a feel for it) https://github.com/tobega/aoc2023/tree/main

As a general tip, it is often helpful to first try to think of how you would like to represent the data in your program. Then you need to parse the data into that structure. I'd recommend you to look at a PEG-parser, for example. Or if you like, look at my Tailspin programming language which has a very visual parser syntax and also very visual ways of creating data structures (if that should happen to be your mental affinity). Look at my day1 for example. Or if you're more mathematical, maybe a functional language (I also did day1 in Pyret)

My Tailspin language is based on processing streams of values, you might want to look at it https://github.com/tobega/tailspin-v0

Many people had trouble with the day 7 problem. Paradoxically, good developers probably had more trouble. Here some of the difficulties are explained and implementations are provided in imperative, functional and OO styles, written in the Tailspin programming language.

I test almost entirely from my language, that way the tests are independent of the implementation. Currently the tests are implemented in java because that fits the interpreter implementation https://github.com/tobega/tailspin-v0/tree/master/test/tailspin/samples

Finished off the implementation of typed and offset array indices in Tailspin

I ended up enabling left recursion in Tailspin's composer (parser) syntax. Much cleaner calculator example now.

I think it's possible that Tailspin might be suitable for you.

I think gradual typing is definitely something worth exploring more. I thought it was a shame when Dart abandoned that path. Have you seen Shen ? I guess my small offering, Tailspin, is currently evolving to gradual typing as well.