next up previous contents
Next: 7.3 The registers Up: 7.2 The data structures Previous: 7.2.2 The heap

7.2.3 The trail

Contrary to other implementations the trail is realized as a LISP list. This is possible since no random access may happen on that structure. Either a reference is pushed on the trail (when a binding occurs) or the information is popped sequentially (when backtracking to a certain point occurs).



Harold Boley (boley@informatik.uni-kl.de)