Re: Q: Recursive Descent w/Backtracking

rockwell@nova.umd.edu (Raul Deluth Miller)
Fri, 28 Oct 1994 16:37:28 GMT

          From comp.compilers
Related articles
Q: Recursive Descent w/Backtracking SCHMIDTG@iccgcc.cs.hh.ab.com (1994-10-21)
Re: Q: Recursive Descent w/Backtracking rockwell@nova.umd.edu (1994-10-28)
Re: Q: Recursive Descent w/Backtracking ichudov@wiltel.com (1994-10-28)
Re: Q: Recursive Descent w/Backtracking davidm@Rational.COM (1994-10-25)
Re: Q: Recursive Descent w/Backtracking bevan@cs.man.ac.uk (1994-10-31)
Re: Q: Recursive Descent w/Backtracking pjj@cs.man.ac.uk (1994-10-28)
Re: Q: Recursive Descent w/Backtracking hbaker@netcom.com (1994-11-03)
Re: Q: Recursive Descent w/Backtracking ridoux@irisa.fr (1994-11-07)
| List of all articles for this month |
Newsgroups: comp.compilers
From: rockwell@nova.umd.edu (Raul Deluth Miller)
Keywords: parse
Organization: University of Maryland University College
References: 94-10-151
Date: Fri, 28 Oct 1994 16:37:28 GMT

Greg Schmid:
: One pitfall with RDB is that if not implemented properly, the order
: of productions can affect whether or not a solution is found.


I have not had that experience.


: So does anyone have a lucid description of an algorithm which will
: handle backtracking over all possibilites of a grammar tree?


For each possible *terminal* in the grammar, (recursively) attempt to
parse the remaining text stream. Return failure only when each of
these possibilities have failed.


--
Raul D. Miller
<rockwell@nova.umd.edu>
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.