From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,63d97587cee64bd1
X-Google-Attributes: gid103376,public
From: Brian Rogoff <bpr@shell5.ba.best.com>
Subject: Re: Expression Parser
Date: 1999/07/29
Message-ID: <Pine.BSF.4.10.9907291945470.15361-100000@shell5.ba.best.com>#1/1
X-Deja-AN: 506826241
References: 
 <Pine.A41.3.96-heb-2.07.990727211225.17736A-100000@pluto.mscc.huji.ac.il>
Content-Type: TEXT/PLAIN; charset=US-ASCII
X-Trace: nntp1.ba.best.com 933303521 221 bpr@206.184.139.136
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Date: 1999-07-29T00:00:00+00:00
List-Id: <comp.lang.ada>

On Tue, 27 Jul 1999, Ehud Lamm wrote:
> Does anyone know of simple embeddable exprssion parser that I can reuse?
> Ideally should support numeric as well as string data, and if constructs.

John English's excellent Ada intro uses an expression parser as one of his 
examples, and the code seemed easy to pick through IMO. The code is on
his web page. http://www.it.bton.ac.uk/je/adacraft/. 

If its truly simple as you say then recursive descent is a quick enough 
way to code it up, and contrary to popular opinion, can certainly handle
some grammars that are not LL(1). 

-- Brian