|Prolog and evaluating expressions email@example.com (James Sison) (2007-10-04)|
|Re: Prolog and evaluating expressions firstname.lastname@example.org (Nils M Holm) (2007-10-05)|
|From:||James Sison <email@example.com>|
|Date:||Thu, 4 Oct 2007 17:47:49 -0700 (PDT)|
|Posted-Date:||04 Oct 2007 22:16:24 EDT|
I'm trying to write this prolog interpreter but i encountered a
problem. Let's say i'm evaluating a rule and i found a possible
solution. How will i store my current position in the parse tree of
the rule if i'm going back to it when i backtrack? I'm thinking of
using a stack but then, i have no idea how to use it for this
application. Do you guys have any opinions on the matter?
Return to the
Search the comp.compilers archives again.