Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site sdccs7.UUCP
Path: utzoo!watmath!clyde!akgua!sdcsvax!sdccs7!ee163ahp
From: ee163ahp@sdccs7.UUCP (GALACTUS)
Newsgroups: net.micro.apple
Subject: LL(1) parser for an apple. (are you mad?!?)
Message-ID: <1219@sdccs7.UUCP>
Date: Wed, 16-May-84 01:28:45 EDT
Article-I.D.: sdccs7.1219
Posted: Wed May 16 01:28:45 1984
Date-Received: Sat, 12-May-84 09:38:34 EDT
References: <1207@sdccs7.UUCP>, <133@moscom.UUCP>
Organization: U.C. San Diego, Computer Center
Lines: 17

In response to "why would anyone want to write a recursive descent
parser"
Okay, well gee, as i understand it, as told to me by the gentleman in
hawaii, the ll(1) parse tables are not easy to fill in.
I suppose you should ask Per Brinch Hansen or
Hoare, why they recommend recursive descent for 
micro computers.

It seems that the only feasible way to write a parser for
a MICRO-COMPUTER is to use recursive descent. This saves
the time that would be spent figuring out the parse tables
for ll(1). Also, there are a zillion states for even a moderate
sized language.

Nick.
.