Lisp-in-Charm VS go-regex

This explanation of how to do it in Python is useful. I used it as a model for doing a Lisp in Charm, though there are differences of detail in the implementation.

I linked to an example of Lisp implemented in Charm. (Compare to Peter Norvig's Lisp implemented in Python, which goes about it a slightly different way but implements the exact same features.)

Here's my own Lisp, in my language. I wonder how many of us have done this.

Then to celebrate I used the strings library to make my implementation of Lisp in Charm shorter: it weighs in at 123 sloc now I don't have to roll my own string functions.

I have dogfooded it by usng it to implement other languages, a Forth, a Z80 emulator, and most recently a Lisp, to prove that it has chops as a GPL.

More dogfooding! Having done all that work to make Charm more useable, I wanted to use some darn Charm. It's pretty nice to code in now, this was not hard to do. Here's the listing.

For regex, I would suggest making sure you use PCRE, since the built-in RE2 is slower and more limited. I also have a go module that uses PCRE regex with a cache, and some JavaScript like features: https://github.com/AspieSoft/go-regex