These things tend to be a slippery slope. Turing completeness is at the bottom of that hill.
On Wed, Jan 5, 2011 at 12:18 PM, frank asseg <frank.as...@congrace.de>wrote: > Hola Ted, > > On 05.01.2011 21:02, Ted Dunning wrote: > > Or bsh or jruby or rhino or groovy? > sorry, i did not make myself clear but i was talking about a pure > mathematical expresssion parser, intended for evaluating user input and > the like, not a turing complete grammer but simply a way to evaluate > thigs like "log(2)^2.4" at runtime. > > Have fun! > > -- > *frank asseg* > softwareentwicklung > sebastian-kneipp-strasse 14a > 79104 freiburg i. brsg. > tel.: ++49-761-88790001 > fax.: ++49-761-88790002 > mail: frank.as...@congrace.de > > --------------------------------------------------------------------- > To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org > For additional commands, e-mail: dev-h...@commons.apache.org > >
