IQ 100: 
javascript bootcamp enjoyer
IQ 110: BASIC enjoyer
IQ 130: lisp enjoyer
IQ 400: forth transcendent
javascript bootcamp enjoyerIQ 110: BASIC enjoyer
IQ 130: lisp enjoyer
IQ 400: forth transcendent
@icedquinn Stack-based languages are only useful if you are implementing them only because they are easiest to parse.
Follow
@icedquinn Stack-based languages don't need parse trees. You just need a stack and a lexer. I've written a stack-based interpreter over the summer.
@xianc78 yes i did that in like two hours 
i mean more the part that they are only useful because of that i have doubts
i mean more the part that they are only useful because of that i have doubts
