-=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- (c) WidthPadding Industries 1987 0|612|0 -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=-
SoCoder -> Blogs Home -> Blogs


 
Pixel_Outlaw
Created : 15 June 2025
 

Growing a Programming Language From 'Max



Not ready for prime time.

Get your syrup, there is some waffling but I try to provide a good foundation for various topics.


View on YouTube

 

Comments


Sunday, 15 June 2025, 23:31
Kuron

Monday, 23 June 2025, 14:19
Pixel_Outlaw
Got WHILE implemented...

WHILE is the primitive for all other loops.

I still need to implement the early return part. I'll need to read up on how that's usually implemented in Lisp too for lexical scope.
I'm glad I'm doing things correctly. I want B-LISP to be traditional and not as short sighted and opinionated as say Clojure.

I don't have safe recursion yet (but I DO have recursion) (I need to understand transforming tail calls into safe forms that don't grow the stack)

Monday, 23 June 2025, 15:32
Jayenkai
Good luck
Monday, 23 June 2025, 21:16
Pixel_Outlaw
I've updated the source code.
It's still very much subject to change since these are the early days.
My stuff is usually open source but I retain the rights.

Anyway might be interesting to look at I suppose.