|[3 earlier articles]|
|Re: Choosing a parser for Mathematica input firstname.lastname@example.org (David Kirkby) (2010-11-09)|
|Re: Choosing a parser for Mathematica input email@example.com (Wink Zhang) (2010-11-13)|
|Re: Choosing a parser for Mathematica input firstname.lastname@example.org (Ira Baxter) (2010-11-26)|
|Re: Choosing a parser for Mathematica input email@example.com (David Kirkby) (2010-11-26)|
|Re: Choosing a parser for Mathematica input firstname.lastname@example.org (David Kirkby) (2010-11-27)|
|Re: Choosing a parser for Mathematica input email@example.com (2015-02-05)|
|Re: Choosing a parser for Mathematica input firstname.lastname@example.org (Robert Jacobson) (2015-02-06)|
|From:||Robert Jacobson <email@example.com>|
|Date:||Fri, 6 Feb 2015 19:04:08 -0800 (PST)|
|Posted-Date:||06 Feb 2015 22:16:11 EST|
I am among those who are trying to write a Mathematica parser. There are a few
Mathematica parsers out there.
* Richard Fateman's old MockMMA of course (written in Lisp) which is mentioned
in the first post of this thread from 2010.
* This MIT-licensed parser written in Scala is notable. Written by Mateusz
Paprocki "and contributors" a couple of years ago.
* Alex Gittens's basicCAS is a python Mathematica parser, but it appears to
have disappeared from the author's website. It's still available elsewhere on
the net for those interested in looking for it. This project is interesting
because it includes Alex's notes regarding implementation.
* Mathics, a Mathematica clone written in Python and created by Jan Pvschko,
is particularly interesting. You can use it online. GPL licensed, copyright
* omath is similar in spirit to Mathics but is written in Java and appears to
have been abandoned at version 10^(-16) in 2005. The parser is a generated
parser using JavaCC and JJTree. The source code is distributed without a
* symja contains a Mathematica parser for a reasonable subset of Mathematica.
SymPy and Sage both have rudimentary Mathematica parsers that work for basic
mathematical expressions. There are also some (rumors of) proprietary
Mathematica parsers. John Herrop of Flying Frog Consultancy claims to have
written a Mathematica parser in 300 lines of OCaml under contract for Wolfram
Research. The code is obviously not publicly available. Semantic Designs, a
company specializing in compiler technologies, lists Mathematica among the
many languages for which it has "front ends." (Both mentioned here:
Wolfram Research may be grotesquely litigious, but given the existence of so
many of these projects it seems to me they are no longer interested in suing
everyone who even thinks the word Mathematica as they once were.
My own project is to construct an ANTLR4 grammar for Mathematica. Such a
grammar seems to me to be the easiest way to benefit the most people with
targets (some better than others), and a c/c++ target is allegedly in the
works. Several projects have expressed interest in such a thing, but it
appears nobody has succeeded in producing it. I am very happy with how far I
was able to get with very little effort, but my grammar isn't yet ready for
public consumption (read: doesn't work). See my top-level post to this
community for an example of one of the problems I'm still trying to solve with
Return to the
Search the comp.compilers archives again.