sparser

From the paper linked to in the README, this is: "a new approach for building source-to-source transformations that can run on multiple programming languages, based on a new way of representing programs called incremental parametric syntax. We implement this approach in Haskell in our Cubix system, and construct incremental parametric syntaxes for C, Java, JavaScript, Lua, and Python." http://www.jameskoppel.com/files/papers/oopsla18main-p221-p.... --- A couple of (somewhat) related projects I came across recently: AST Explorer https://github.com/fkling/astexplorer/blob/master/README.md Sparser the Universal Parser https://github.com/Unibeautify/sparser#readme What these have in common is that they include a collection of parsers, which represent programs in a language-agnostic data structure.

* https://sparser.io * https://github.com/Unibeautify/sparser This is my attempt at creating a universal language parser. It attempts to solve a couple of problems: * Support multiple languages * Recursively extend support to languages embedded within other languages * Output a uniform format for all supported languages This is a personal project so any feedback would be helpful. Something interesting I found after I built it is that this parser is not as fast to write output as many other JavaScript parsers, but its output is much faster to read from due to the simplicity and predictability of the format.