agl

I worked on a toy programming language (that compile down to golang), which is a fork of the go lexer/parser, but it changes how functions can only return one value allowing the use of Result[T]/Option[T] and error propagation operators `!` and `?`. It has enums (sum type), tuple, built-in Set[T], and good Iterator methods. It has very nice type inferred lambda function (heavily inspired by the swift syntax)... lots of good stuff! https://github.com/alaingilbert/agl

While I'm unsure about the efficacy of LLMs, I do yearn for language tooling that lets you 'Bring Your Own Syntax'. I'm someone who prefers TypeScript, Java, and Zig's syntax and genuinely, genuinely struggles with Go, Crystal, Kotlin's syntax. Whoever came up with := versus = needs to stub their toe at least once a day for the rest of time. But if I could write code for Go using a different syntax, I'd write way more Go code. I feel like that's what petlangs like Borgo (https://github.com/borgo-lang/borgo) and AGL (https://github.com/alaingilbert/agl) are doing: making Go less goey.

I'm working on this programming language that compiles to Go. The goal is to have it behave like typescript for Go, where any Go program would compile out of the box, but then you can use the new syntax. Featuring: built-in Set/Enum/Tuple/lambda/"error propagation operators" It also have a working LSP server and generates a sourcemap, so when you get a runtime stacktrace, it gives you the original line in your .agl file as well as the one in the generated .go file. I recently finish porting all my "advent of code 2024" in AGL -> https://github.com/alaingilbert/agl/tree/master/examples/adv... https://github.com/alaingilbert/agl

Check out this toy project I made. It's basically a fork of the Go lexer/parser that adds Result/Option/Tuple/Set... propagation operators (and more) and it compiles down to Go code. https://github.com/alaingilbert/agl

Yes, I got my inspiration mainly from swift and a little bit from vlang as well. eg: the @LINE "Compile time pseudo variable" https://github.com/alaingilbert/agl/blob/8b656a385207e57fd0f... https://docs.vlang.io/conditional-compilation.html#compile-t...

I spent the past 2 weeks making this toy programming language. I basically forked the Go scanner/parser, and changed the syntax to have functions return a single value. This enable proper Result/Option type to be used as well as propagating errors with an operator. I also wanted to have short "type inferred" anonymous functions to be able to use functions like Map/Reduce/Filter, without having to use 100 characters to specify the types.