From 7d9bbea985f818dabe6b98496d7b8a47fb560016 Mon Sep 17 00:00:00 2001
From: krasimir <krasimir@chalmers.se>
Date: Sat, 2 Oct 2010 13:34:58 +0000
Subject: [PATCH] backtracking for random generation is not enough. we must
 restart the search after each solution

---
 src/runtime/haskell/PGF/Generate.hs | 19 +++++++++++++------
 1 file changed, 13 insertions(+), 6 deletions(-)

diff --git a/src/runtime/haskell/PGF/Generate.hs b/src/runtime/haskell/PGF/Generate.hs
index 55bfd72d9..86cfaa47b 100644
--- a/src/runtime/haskell/PGF/Generate.hs
+++ b/src/runtime/haskell/PGF/Generate.hs
@@ -44,23 +44,21 @@ generateFromDepth pgf e dp = generateForMetas False pgf (\ty -> generateAllDepth
 -- This is usefull for tree bank generation which after that can be used
 -- for grammar testing.
 generateRandom :: RandomGen g => g -> PGF -> Type -> [Expr]
-generateRandom g pgf ty = 
-    generate (Identity g) pgf ty Nothing
+generateRandom g pgf ty = generateRandomDepth g pgf ty Nothing
 
 -- | A variant of 'generateRandom' which also takes as argument
 -- the upper limit of the depth of the generated expression.
 generateRandomDepth :: RandomGen g => g -> PGF -> Type -> Maybe Int -> [Expr]
-generateRandomDepth g pgf ty dp = generate (Identity g) pgf ty dp
+generateRandomDepth g pgf ty dp = restart g (\g -> generate (Identity g) pgf ty dp)
 
 -- | Random generation based on template
 generateRandomFrom :: RandomGen g => g -> PGF -> Expr -> [Expr]
-generateRandomFrom g pgf e = 
-  generateForMetas True pgf (\ty -> generate (Identity g) pgf ty Nothing) e
+generateRandomFrom g pgf e = generateRandomFromDepth g pgf e Nothing
 
 -- | Random generation based on template with a limitation in the depth.
 generateRandomFromDepth :: RandomGen g => g -> PGF -> Expr -> Maybe Int -> [Expr]
 generateRandomFromDepth g pgf e dp = 
-  generateForMetas True pgf (\ty -> generate (Identity g) pgf ty dp) e
+  restart g (\g -> generateForMetas True pgf (\ty -> generate (Identity g) pgf ty dp) e)
 
 
 
@@ -197,3 +195,12 @@ instance RandomGen g => Selector (Identity g) where
         | d < p     = (p,x,xs)
         | otherwise = let (p',x',xs') = hit (d-p) xs
                       in (p,x',px:xs')
+
+-- Helper function for random generation. After every
+-- success we must restart the search to find sufficiently different solution.
+restart :: RandomGen g => g -> (g -> [a]) -> [a]
+restart g f =
+  let (g1,g2) = split g
+  in case f g1 of
+       []     -> restart g2 f
+       (x:xs) -> x : restart g2 f