Add (incomplete) test case for queens.tig

[tiger.ml.git] / tiger / src / exe / tiger_tests.ml

diff --git a/tiger/src/exe/tiger_tests.ml b/tiger/src/exe/tiger_tests.ml
index 266797e..761d43e 100644 (file)
--- a/tiger/src/exe/tiger_tests.ml
+++ b/tiger/src/exe/tiger_tests.ml
@@ -147,26 +147,54 @@ let test_09 =
   (* TODO: Type error test case *)
   (name, code, tokens)
 
-let tokens_of_code code =
-  let lexbuf = Lexing.from_string code in
-  let rec tokens () =
-    let token = Tiger.Lexer.token lexbuf in
-    (* Avoiding fragile pattern-matching *)
-    if token = Tiger.Parser.EOF then [] else token :: tokens ()
+let test_queens =
+  let code =
+    " \n\
+    /* A program to solve the 8-queens problem */ \n\
+ \n\
+    let \n\
+      var N := 8 \n\
+ \n\
+      type intArray = array of int \n\
+ \n\
+      var row := intArray [ N ] of 0 \n\
+      var col := intArray [ N ] of 0 \n\
+      var diag1 := intArray [N+N-1] of 0 \n\
+      var diag2 := intArray [N+N-1] of 0 \n\
+ \n\
+      function printboard() = ( \n\
+        for i := 0 to N-1 do ( \n\
+          for j := 0 to N-1 do print(if col[i]=j then \" O\" else \" .\"); \n\
+          print(\"\n\") \n\
+        ); \n\
+        print(\"\n\") \n\
+      ) \n\
+ \n\
+      function try(c:int) = ( \n\
+        /*  for i:= 0 to c do print(\".\"); print(\"\n\"); flush();*/ \n\
+        if c=N \n\
+        then printboard() \n\
+        else \n\
+          for r := 0 to N-1 \n\
+          do \n\
+            if row[r]=0 & diag1[r+c]=0 & diag2[r+7-c]=0 \n\
+            then ( \n\
+              row[r]       := 1; \n\
+              diag1[r+c]   := 1; \n\
+              diag2[r+7-c] := 1; \n\
+              col[c]       := r; \n\
+              try(c+1); \n\
+              row[r]       := 0; \n\
+              diag1[r+c]   := 0; \n\
+              diag2[r+7-c] := 0 \n\
+            ) \n\
+      ) \n\
+    in \n\
+      try(0) \n\
+    end \n\
+    "
   in
-  tokens ()
-
-let parsetree_of_code code =
-  let lb = Lexing.from_string code in
-  (match Tiger.Parser.program Tiger.Lexer.token lb with
-  | exception Parsing.Parse_error ->
-      let module L = Lexing in
-      let L.({lex_curr_p = {pos_lnum=l; pos_bol=b; pos_cnum=c; _}; _}) = lb in
-      let msg = sprintf "Syntax error around line: %d, column: %d" l (c - b) in
-      Error msg
-  | parsetree ->
-      Ok parsetree
-  )
+  (code, code, [])
 
 let tests =
   [ test_01
@@ -174,9 +202,31 @@ let tests =
   ; test_03
   ; test_04
   ; test_09
+  ; test_queens
   ]
 
 let () =
+  let tokens_of_code code =
+    let lexbuf = Lexing.from_string code in
+    let rec tokens () =
+      let token = Tiger.Lexer.token lexbuf in
+      (* Avoiding fragile pattern-matching *)
+      if token = Tiger.Parser.EOF then [] else token :: tokens ()
+    in
+    tokens ()
+  in
+  let parsetree_of_code code =
+    let lb = Lexing.from_string code in
+    (match Tiger.Parser.program Tiger.Lexer.token lb with
+    | exception Parsing.Parse_error ->
+        let module L = Lexing in
+        let L.({lex_curr_p = {pos_lnum=l; pos_bol=b; pos_cnum=c; _}; _}) = lb in
+        let msg = sprintf "Syntax error around line: %d, column: %d" l (c - b) in
+        Error msg
+    | parsetree ->
+        Ok parsetree
+    )
+  in
   let bar_sep = String.make 80 '-' in
   let bar_end = String.make 80 '=' in
   let indent n = String.make (2 * n) ' ' in