From: Ehud Lamm <mslamm@mscc.huji.ac.il>
Subject: Re: Expression Parser
Date: 1999/07/30
Date: 1999-07-30T00:00:00+00:00 [thread overview]
Message-ID: <Pine.A41.3.96-heb-2.07.990730082223.36832A-100000@pluto.mscc.huji.ac.il> (raw)
In-Reply-To: Pine.BSF.4.10.9907291945470.15361-100000@shell5.ba.best.com
On Thu, 29 Jul 1999, Brian Rogoff wrote:
|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/.
Hi,
I already checked his parser, in chapter 17. But I think I like your
second option better.
|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).
Quite. As I said in my previous posts, or at least I think I said it - it
seems I'll hack a recursive decent parser myself. Won't be the first time.
In many cases it is faster to do that than use a parser generator, even
when there are tons that float arround.
Ehud Lamm mslamm@pluto.mscc.huji.ac.il
http://purl.oclc.org/NET/ehudlamm <== My home on the web
prev parent reply other threads:[~1999-07-30 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
1999-07-30 0:00 ` Ehud Lamm [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox