| Related articles |
|---|
| [6 earlier articles] |
| Re: Recursive Descent Parsers and YACC henry@zoo.toronto.edu (1990-11-17) |
| Re: Recursive Descent Parsers and YACC mailrus!sharkey!hela!iti.org!dhw@uunet.UU.NETid AA (1990-11-20) |
| Recursive Descent Parsers and YACC grosch@gmdka.uucp (Josef Grosch) (1990-11-22) |
| Re: Recursive Descent Parsers and YACC grimlok@hubcap.clemson.edu (1990-11-23) |
| Recursive Descent Parsers and YACC jsp@milton.u.washington.edu (Jeff Prothero) (1990-11-23) |
| Re: Recursive Descent Parsers and YACC melling@psuvax1.cs.psu.edu (1990-11-26) |
| Re: Recursive Descent Parsers and YACC moss@cs.umass.edu (1990-11-26) |
| Re: Recursive Descent Parsers and YACC aycock@cpsc.ucalgary.ca (1990-11-26) |
| Newsgroups: | comp.compilers |
| From: | moss@cs.umass.edu (Eliot Moss) |
| In-Reply-To: | grimlok@hubcap.clemson.edu's message of 23 Nov 90 16:31:03 GMT |
| Keywords: | parse, design |
| Organization: | Dept of Comp and Info Sci, Univ of Mass (Amherst) |
| References: | <F7p?bk63@cs.psu.edu> <11678@hubcap.clemson.edu <5602@labtam.labtam.oz> <11800@hubcap.clemson.edu> |
| Date: | 26 Nov 90 13:27:14 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
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.