|prolog and recursive descent parsing? email@example.com (carl immanuel manalo) (2007-09-16)|
|Re: prolog and recursive descent parsing? firstname.lastname@example.org (email@example.com) (2007-09-18)|
|Re: prolog and recursive descent parsing? firstname.lastname@example.org (2007-09-19)|
|Re: prolog and recursive descent parsing? email@example.com (2007-09-21)|
|From:||carl immanuel manalo <firstname.lastname@example.org>|
|Date:||Sun, 16 Sep 2007 16:44:28 -0700 (PDT)|
|Keywords:||prolog, parse, question|
How does prolog use recursive descent parsing to solve problems given
to it?. Does it make a graph of the parse tree or something?
I've only encountered recursive descent parsing to solve problems like
boolean algebra or number arithmetic but prolog can do much more than
I understand that it's easy enough to do for facts like.
one only has to compare the query to the facts in the database per
token. but what about rules like?
I find it difficult to imagine that you would only check them per
So, how does prolog handle this?
Return to the
Search the comp.compilers archives again.