ohm VS match-iz

Building an interpreter or a compiler from a grammar is an interesting idea. I can't immediately see how to go about it - the grammar would need to match on SSA or similar.

The examples have a lisp-like interpreter at https://github.com/ohmjs/ohm/blob/main/examples/simple-lisp/... which definitely uses a grammar for parsing and might use a generic AST representation.

Will have to think more - a grammar might be a worthwhile way to specify a nanopass style compiler pipeline.

Look for OMeta and its successor Ohm.

One more suggestion: Maybe create your own scripting-language using Ohm? The project works in JavaScript, so whatever you created would sit on top of your existing APIs.

OMeta and its successor ohm might provide some interesting ideas.

Always fun to find the first commit:

https://github.com/harc/ohm/commit/4611bf63c5ecb90d782112d68...

2014

Neat tool. I write parsers by hand though. More fun, and you can be a lot sleazier.

Thank you, and it does!

I do enjoy a bit of monad'ing. I often use this minimal Maybe in projects, inspired by Folktale and Crocks.

I've done a little myself with eslint-plugins and codemods and found it useful for avoiding repetition and ?.. There's a TC39 proposal that's in the works, but I got impatient and wrote a small lib that tries to provide the same functionality.

I'm doing my part, though!

Honestly, my own. Not that I can take credit for the fundamental shape of the API -- it's directly inspired by the TC39 pattern-matching proposal. Still, I use it all the time and can't wait for the day when I don't have to.

Slightly related is this pattern matching library I saw the other week, you might be interested: https://github.com/shuckster/match-iz

JavaScript doesn't have that natively yet, but you can get close using a library:

While pattern-matching doesn't exist in the language yet, there are many libraries on NPM for it, and it looks applicable for your own use-cases. (Full disclosure: The above example is from my own.)

After learning about the exciting, but sadly only Stage 1 proposal for pattern-matching in JavaScript, I felt compelled to write a library that tries to, erm, match it as closely as I could: