|prolog and recursive descent parsing? firstname.lastname@example.org (carl immanuel manalo) (2007-09-16)|
|Re: prolog and recursive descent parsing? email@example.com (firstname.lastname@example.org) (2007-09-18)|
|Re: prolog and recursive descent parsing? email@example.com (2007-09-19)|
|Re: prolog and recursive descent parsing? firstname.lastname@example.org (2007-09-21)|
|From:||email@example.com (Hans Aberg)|
|Date:||Wed, 19 Sep 2007 19:51:24 GMT|
|Posted-Date:||19 Sep 2007 15:59:46 EDT|
carl immanuel manalo <firstname.lastname@example.org> wrote:
> How does prolog use recursive descent parsing to solve problems given
> to it?. Does it make a graph of the parse tree or something?
The Haskell Hugs <http://haskell.org/hugs/> comes with a Mini-Prolog demo,
and fiddling around with it is great. There is also the book Sterling &
Shapiro, "The Art of Prolog". And the Usenet newsgroup comp.lang.prolog.
In brief, the Prolog engine keeps a list of statements, called goals,
and looks for a substitution that proves them from the database,
starting of with the initial query. It lops off the first goal in the
list, and checks for unifications (substitutions that make the
expressions identical) with the heads of the database statements, and
if there is a match: if the statement has empty body, it is a proof,
and if it is non-empty, the body statements are added to the list of
goals. And so, recursively.
Thus, it makes a first depth of the proof tree, also specializing the
goals (a mathematical proof of the original statement does not admit
specialization of the statements in the goal list, only those in the
database). It works like an ordinary function stack that can branch
the search for functions (when unification matches more that one
statement in the database).
Return to the
Search the comp.compilers archives again.