Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles; site iuvax.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxn!ihnp4!inuxc!iubugs!iuvax!jec
From: jec@iuvax.UUCP
Newsgroups: net.micro.amiga
Subject: Re: Re: Recursive descent compilers (fro
Message-ID: <41000010@iuvax.UUCP>
Date: Mon, 10-Feb-86 12:19:00 EST
Article-I.D.: iuvax.41000010
Posted: Mon Feb 10 12:19:00 1986
Date-Received: Fri, 14-Feb-86 01:23:31 EST
References: <256@sdcc7.UUCP>
Lines: 10
Nf-ID: #R:sdcc7:-25600:iuvax:41000010:000:378
Nf-From: iuvax!jec    Feb 10 12:19:00 1986


	I'm confused.  I remember writing a recursive decent parser for an
LL(1) grammar.  Is there some other parse method that is assumed with LL(1)
grammars that I'm not aware of?  Is my memory faulty?


James E. Conley			Usenet: {ihnp4,pur-ee,purdue}!iuvax!jec
I.U. Dept. of Linguistics	Phone:	(812) 335-8702 [Work]
401 Lindley Hall			(812) 333-6702 [Home]
Bloomington, IN. 47405