Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site spuxll.UUCP
Path: utzoo!watmath!clyde!akgua!mcnc!decvax!harpo!ulysses!mhuxl!houxm!hogpc!houti!ariel!vax135!floyd!whuxle!spuxll!ech
From: ech@spuxll.UUCP
Newsgroups: net.micro.apple
Subject: Re: C compiler
Message-ID: <470@spuxll.UUCP>
Date: Mon, 14-May-84 17:48:46 EDT
Article-I.D.: spuxll.470
Posted: Mon May 14 17:48:46 1984
Date-Received: Wed, 16-May-84 07:22:31 EDT
References: <288@sjuvax.UUCP>
Organization: AT&T Information Systems, South Plainfield NJ
Lines: 11

What possible reason would you have to USE an LL(k)-based parser generator?
(given that you can use yacc, that is.)  Yacc is based on LALR(1), see
the paper by Aho and Johnson (Computing Surveys, 1974 -- happy 10th 
anniversary!), and is far and away the easiest tool for HUMANS to use to
construct parsers; by contrast, LL(1) is much more restrictive, and
operator precedence is a REAL bear.

Sorry, didn't mean to come on so strong, there.  IS there any good reason
to use any top-down method?

=Ned=