Re: Q: Recursive Descent w/Backtracking

pjj@cs.man.ac.uk (Pete Jinks)
Fri, 28 Oct 1994 15:48:44 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: pjj@cs.man.ac.uk (Pete Jinks)
Keywords: parse, LL(1)
Organization: Dept of Computer Science, University of Manchester, U.K.
References: 94-10-151
Date: Fri, 28 Oct 1994 15:48:44 GMT

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


Try Prolog, which is exactly suited to this problem. If you *really* want to
know how to do it yourself, read about how Prolog is implemented.
--

Post a followup to this message

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