Compiling nondeterministic computations
Abstract
Implementing a compiler for a language with non-deterministic features is known to be a difficult task. This paper presents two new functions and fail that extend the C language to efficiently handle choice point management. Algorithms and implementation techniques are detailed. We illustrate their use by presenting the classical 8-queens problem. Then, we give compilation schemes for the language ELAN in order to illustrate the power and the easy use of setChoicePoint and fail to design new compilation schemes for non-deterministic computation.