Skip to main content

I got wondering how much work it would be to compile s-expressions to #uxn, it turns out, not a lot.

As a test, I've only implemented `let`, but it's shockingly easy to map lisp-like syntax to the uxn assembly, I might push this further still.

https://git.sr.ht/~rabbits/qzil/tree/master/item/src/qzil.tal

~rabbits/qzil (master): src/qzil.tal - sourcehut git

git.sr.ht
#uxn
This entry was edited (5 months ago)
Unknown parent

Devine Lu Linvega
Devine Lu Linvega
• •
@spnw it does feel that way 😀
in reply to Devine Lu Linvega

ferunando
ferunando
• •

@spnw 🤔 to me it feels... sideways? a dual approach kinda thing... like in quantum mechanics where you can write the same system in more than one basis but the underlying dynamics is the same? and i don't mean in the sense that both are programming abstractions.

sorry, got rambly. haven't studied programming languages development theory, but yeah, i love this kinda shared thing between both styles.

in reply to Devine Lu Linvega

WimⓂ️
WimⓂ️
• •
That is essentially what Funktal does, except that I didn't implement the let-syntax yet, because it's only syntactic sugar for lambdas. I'll do it eventually as it is very convenient.
in reply to WimⓂ️

Devine Lu Linvega
Devine Lu Linvega
• •
@wim_v12e I should have gone straight for lambdas but I didn't think I'd get very far. I'll do defines today and maybe make let on top of lambda.
@WimⓂ️
Unknown parent

Devine Lu Linvega
Devine Lu Linvega
• •
@zens yup, the first time I did it was for the SECD stack machine which had a lot more convenient operations for hosting a functional language.
https://wiki.xxiivv.com/site/secd.html

XXIIVV — secd

wiki.xxiivv.com
Unknown parent

Devine Lu Linvega
Devine Lu Linvega
• •
@overanalytcl I'd like to implement its own compiler.

Lo, thar be cookies on this site to keep track of your login. By clicking 'okay', you are CONSENTING to this.

⇧