Re: Describing parm card dependencies in a database -- MIDRANGE-L

× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.

Subject: Re: Describing parm card dependencies in a database
From: "Leif Svalgaard" <leif@xxxxxxxx>
Date: Wed, 30 Oct 2002 13:32:59 -0600
List-archive: <http://archive.midrange.com/midrange-l/>
List-help: <mailto:midrange-l-request@midrange.com?subject=help>
List-id: Midrange Systems Technical Discussion <midrange-l.midrange.com>
List-post: <mailto:midrange-l@midrange.com>
List-subscribe: <http://lists.midrange.com/cgi-bin/listinfo/midrange-l>,<mailto:midrange-l-request@midrange.com?subject=subscribe>
List-unsubscribe: <http://lists.midrange.com/cgi-bin/listinfo/midrange-l>,<mailto:midrange-l-request@midrange.com?subject=unsubscribe>

From: Metz, Zak <Zak_Metz@G1.com>
Can anyone guide me to a starting point for parsing/evaluating an expression?

here is a starting point:

http://digilander.libero.it/foxes/MathExpressionsParser.htm

As an Amazon Associate we earn from qualifying purchases.

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.