Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!world!iecc!compilers-sender From: moss@cs.umass.edu (Eliot Moss) Newsgroups: comp.compilers Subject: Re: Recursive Descent Parsers and YACC Keywords: parse, design Message-ID: Date: 26 Nov 90 13:27:14 GMT References: <11678@hubcap.clemson.edu <5602@labtam.labtam.oz> <11800@hubcap.clemson.edu> Sender: compilers-sender@iecc.cambridge.ma.us Reply-To: moss@cs.umass.edu (Eliot Moss) Organization: Dept of Comp and Info Sci, Univ of Mass (Amherst) Lines: 13 Approved: compilers@iecc.cambridge.ma.us In-Reply-To: grimlok@hubcap.clemson.edu's message of 23 Nov 90 16:31:03 GMT Folks, what is this LL(0) stuff? You need at least one token lookahead to choose the correct production in LL or recursive descent parsing, so LL(k) makes sense only for k > 0. -- J. Eliot B. Moss, Assistant Professor Department of Computer and Information Science Lederle Graduate Research Center University of Massachusetts Amherst, MA 01003 (413) 545-4206; Moss@cs.umass.edu -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.