News for hackers. Stuff that matters.
Re:Lisp implemented in under 1K of JavaScript by zardeh on Wednesday February 25, 2015 @06:44PM (#9110535)
So, uhmm,

    def parse(s): return json.loads('['+re.sub('([")])\s*(["(])','\g<1>,\g<2>',re.sub('[^()\s]+','"\g<0>"',s)).replace('(','[').replace(')',']')+']')
works for python, I'm assuming javascript has something equally small
Re:Lisp implemented in under 1K of JavaScript by infogulch on Wednesday February 25, 2015 @07:12PM (#9110634)
Yes, uninteresting, as I said. Lisp syntax is quite simple, so I would not expect it to be very difficult to make a regex to parse it. Btw, does that handle quoted strings, strings with syntax characters in them, and strings with escapes?
Re:Lisp implemented in under 1K of JavaScript by agumonkey on Wednesday February 25, 2015 @07:52PM (#9110758)
And dotted pairs ? I had a super cute sexp parser in PHP, until I started handling sexp fully.
Re:Lisp implemented in under 1K of JavaScript by gps408 on Thursday February 26, 2015 @04:54AM (#9111816)
Would dotted pair notation make sense for this lisp where lists are arrays, not linked cons cells?
Re:Lisp implemented in under 1K of JavaScript by agumonkey on Thursday February 26, 2015 @08:42AM (#9112404)
IMHO, yes, binary building blocks matter a lot in lisp philosophy, whether or not they're built on javascript arrays.
Re:Lisp implemented in under 1K of JavaScript by gps408 on Thursday February 26, 2015 @12:03PM (#9113570)
Thanks for responding, man. That's my point though. There is no cons building block in this lisp. I don't think (1 2 . 3) can be represented in it so having the notation for it makes no sense.