Skip to main content


#DecemberAdventure Today i have corrected a tiny bug in my uxntal code. Then i have started to write a lexer, but i it is not finished and i have nothing to show yet...
http://maxime-andre.fr/december-adventure/
in reply to max22-

have you considered using lambdas to build the trees?

{ 01 02 { 03 { 04 05 } } }

This entry was edited (11 months ago)
in reply to Devine Lu Linvega

@neauoire i wanted to experiment this technique : https://www.youtube.com/watch?v=hzPd3umu78g
(in another talk, "text processing in APL", he parses text without recursion, by using the AST being built as a stack instead, i found that super cool)
in reply to max22-

not necessarily, I mean joy or postscript or factor blocks, are effectively lambdas. But keep it up it looks like you'r doing progress toward parsing your joy-like language 😀 Let me know if you need a hand with anything ✊

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