Related articles |
---|
Bottom-up versus Top-down jacko@post8.tele.dk (Jack Olsen) (1997-11-23) |
Re: Bottom-up versus Top-down thetick@magelang.com (Scott Stanchfield) (1997-11-24) |
Re: Bottom-up versus Top-down gnb@itga.com.au (Gregory Bond) (1997-11-28) |
Re: Bottom-up versus Top-down gclind01@spd.louisville.edu (1997-11-29) |
Re: Bottom-up versus Top-down mkgardne@cs.uiuc.edu (1997-11-30) |
Re: Bottom-up versus Top-down henry@zoo.toronto.edu (Henry Spencer) (1997-11-30) |
Re: Bottom-up versus Top-down rod.bates@wichita.boeing.com (Rodney M. Bates) (1997-12-02) |
[14 later articles] |
From: | Jack Olsen <jacko@post8.tele.dk> |
Newsgroups: | comp.compilers |
Date: | 23 Nov 1997 19:40:19 -0500 |
Organization: | Customer at Tele Danmark Erhverv |
Keywords: | parse, question |
Hi there
Could anyone enlighten me about bottom-up versus top-down parsing?
Thanks in advance
jacko
[Bottom-up parsing looks for strings of tokens in the input which can
match rules in the grammar, then whenever it finds such a string
"reduces" the tokens to the symbol that the rule derives from,
building a parse tree from the bottom up. Top-down starts with the
topmost rule in the grammar, and builds a parse tree from the top down,
looking at the tokens to figure out at each step which of the possible
rules can match. Maybe someone can describe this better. -John]
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.