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: Ehud Lamm <mslamm@mscc.huji.ac.il>
Subject: Re: Expression Parser
Date: 1999/07/30
Message-ID: 
 <Pine.A41.3.96-heb-2.07.990730082223.36832A-100000@pluto.mscc.huji.ac.il>#1/1
X-Deja-AN: 506865225
References: 
 <Pine.A41.3.96-heb-2.07.990727211225.17736A-100000@pluto.mscc.huji.ac.il>
 <Pine.BSF.4.10.9907291945470.15361-100000@shell5.ba.best.com>
Content-Type: TEXT/PLAIN; charset=US-ASCII
Organization: The hebrew University of Jerusalem
Mime-Version: 1.0
Newsgroups: comp.lang.ada
Date: 1999-07-30T00:00:00+00:00
List-Id: <comp.lang.ada>

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