From: Brian Rogoff <bpr@shell5.ba.best.com>
Subject: Re: Expression Parser
Date: 1999/07/29
Date: 1999-07-29T00:00:00+00:00 [thread overview]
Message-ID: <Pine.BSF.4.10.9907291945470.15361-100000@shell5.ba.best.com> (raw)
In-Reply-To: Pine.A41.3.96-heb-2.07.990727211225.17736A-100000@pluto.mscc.huji.ac.il
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
next prev parent reply other threads:[~1999-07-29 0:00 UTC|newest]
Thread overview: 14+ messages / expand[flat|nested] mbox.gz Atom feed top
1999-07-27 0:00 Expression Parser Ehud Lamm
1999-07-28 0:00 ` Jeffrey D. Cherry
1999-07-29 0:00 ` Ehud Lamm
1999-07-29 0:00 ` Martin C. Carlisle
1999-07-31 0:00 ` David Botton
1999-08-01 0:00 ` Ehud Lamm
1999-08-03 0:00 ` David C. Hoos, Sr.
1999-08-04 0:00 ` David Botton
1999-08-05 0:00 ` David C. Hoos, Sr.
1999-08-09 0:00 ` Samuel Tardieu
1999-07-30 0:00 ` Ted Dennison
1999-07-29 0:00 ` Gautier
1999-07-29 0:00 ` Brian Rogoff [this message]
1999-07-30 0:00 ` Ehud Lamm
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox