Compiling nondeterministic computations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1998

Compiling nondeterministic computations


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.
Not file

Dates and versions

inria-00098559 , version 1 (25-09-2006)


  • HAL Id : inria-00098559 , version 1


Pierre-Etienne Moreau. Compiling nondeterministic computations. [Intern report] 98-R-005 || moreau98a, 1998, 16 p. ⟨inria-00098559⟩
54 View
0 Download


Gmail Facebook Twitter LinkedIn More