commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ted Dunning <ted.dunn...@gmail.com>
Subject Re: [lang] math expression parser
Date Wed, 05 Jan 2011 21:36:08 GMT
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.asseg@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.asseg@congrace.de
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
> For additional commands, e-mail: dev-help@commons.apache.org
>
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message