Add Cram tests

Author: engboris

dune-project

@@ -19,7 +19,7 @@
  (name stellogen)
  (synopsis "Stellogen is a minimalistic and logic-agnostic programming
 language based on term unification.")
- (depends base menhir (alcotest :with-test) sedlex ppx_deriving)
+ (depends base menhir sedlex ppx_deriving)
  (tags
   ("transcendental syntax" "logic programming" "constraint programming" "resolution logic" "unification" "self-assembly")))
 

stellogen.opam

@@ -21,7 +21,6 @@ depends: [
   "dune" {>= "3.7"}
   "base"
   "menhir"
-  "alcotest" {with-test}
   "sedlex"
   "ppx_deriving"
   "odoc" {with-doc}

test/README.md

@@ -0,0 +1,49 @@
+# Stellogen Tests
+
+This directory contains Cram tests for Stellogen.
+
+## Test Files
+
+- `subjects.t` - Tests for basic syntax subjects in `test/subjects/`
+- `examples.t` - Tests for all examples in `examples/`
+
+## Running Tests
+
+Run all tests:
+```bash
+dune test
+```
+
+Run tests and update expected outputs:
+```bash
+dune test --auto-promote
+```
+
+Run specific test file:
+```bash
+dune test test/examples.t
+```
+
+## About Cram Tests
+
+Cram tests are simple text-based tests that show shell commands and their expected outputs:
+
+```
+  $ command
+  expected output
+```
+
+When a test runs successfully without any expected output specified, it just verifies the command exits successfully (exit code 0).
+
+## Adding New Tests
+
+To add a new test:
+
+1. Create a `.t` file in this directory
+2. Write commands starting with `  $ ` (two spaces, dollar sign, space)
+3. Run `dune test --auto-promote` to capture the output
+4. Review the promoted output and commit
+
+## Modifying Test Dependencies
+
+Test dependencies are declared in `test/dune`. If you add new test fixtures, add them to the `deps` section.

test/dune

@@ -1,11 +1,10 @@
-(test
- (name test)
- (modules test)
+; Cram tests for Stellogen examples and subjects
+(cram
  (deps
   (glob_files ./subjects/*.sg)
   (glob_files ../examples/*.sg)
-  (glob_files ../exercises/solutions/*.sg))
- (libraries alcotest base stellogen))
+  (glob_files ../exercises/solutions/*.sg)
+  (package stellogen)))
 
 (env
  (dev

test/examples.t

@@ -0,0 +1,93 @@
+Test examples directory
+========================
+
+Automata example:
+  $ sgen run ../examples/automata.sg
+  {}
+  accept
+  {}
+  {}
+
+Binary4 example:
+  $ sgen run ../examples/binary4.sg
+  { [(+b b1 4 1)] [(+b b1 3 0)] [(+b b1 2 0)] [(+b b1 1 0)] }
+  { [(+b b2 4 1)] [(+b b2 3 1)] [(+b b2 2 0)] [(+b b2 1 0)] }
+  { [(+b r 4 1)] [(+b r 3 0)] [(+b r 2 0)] [(+b r 1 0)] }
+  { [(+b r 4 1)] [(+b r 3 1)] [(+b r 2 0)] [(+b r 1 0)] }
+  { [(+b r 4 0)] [(+b r 3 1)] [(+b r 2 1)] [(+b r 1 1)] }
+  { [(+b r2 4 0)] [(+b r2 3 1)] [(+b r2 2 1)] [(+b r2 1 1)] }
+
+Circuits example:
+  $ sgen run ../examples/circuits.sg
+  { [(-c3 0) (-1 0) (-c2 0) (-not 0 0) 0 0] [(-c3 0) (-c2 1) 0 0] }
+  { [(-0 1)] [(-not 0 0)] }
+
+Lambda calculus example:
+  $ sgen run ../examples/lambda.sg
+  [(out (%cons r X7)) (ida (exp (%cons l X7) d))]
+  [(out X7) (x (exp X7 d))]
+
+Linear lambda example:
+  $ sgen run ../examples/linear_lambda.sg
+  {}
+  {}
+
+MALL (multiplicative-additive linear logic) example:
+  $ sgen run ../examples/mall.sg
+  { [(-3 (%cons r (%cons l X4))) (-3 (%cons r (%cons r X4))) || (slice c b)] [(c X11) (d X11) || (slice c a)] }
+
+MLL (multiplicative linear logic) example:
+  $ sgen run ../examples/mll.sg
+  {}
+
+Natural numbers example:
+  $ sgen run ../examples/nat.sg
+  (+nat (s (s (s 0))))
+  (res 1)
+  (res 0)
+
+NPDA (non-deterministic pushdown automaton) example:
+  $ sgen run ../examples/npda.sg
+  { [accept] [accept] }
+  accept
+  accept
+  {}
+
+Prolog-style examples:
+  $ sgen run ../examples/prolog.sg
+  (s (s (s (s 0))))
+  [(-grandparent tom Z0) Z0]
+  { [ok (-to 1)] [(-from 5)] [(-from 4)] [(-from 5)] }
+
+Stack example:
+  $ sgen run ../examples/stack.sg
+  (save 0)
+
+Sum types example:
+  $ sgen run ../examples/sumtypes.sg
+  a
+
+Syntax reference:
+  $ sgen run ../examples/syntax.sg
+  a
+  { [c] [b] [a] }
+  (%string hello world)
+  (function a b)
+  { [(-f X0) (-f Y0) (r X0 Y0) || (!= X Y)] [(+f b)] [(+f a)] }
+  { [(r b a) || (!= b a)] [(r a b) || (!= a b)] }
+  (+n2 (s (s 0)))
+  { [(+field test2) (%cons (+f b) (%cons ok %nil))] [(+field test1) (%cons (+f a) (%cons ok %nil))] }
+  [(+f a) ok]
+  [(+f b) ok]
+  (-field test2)
+
+Turing machine example:
+  $ sgen run ../examples/turing.sg
+  reject
+  reject
+  reject
+  accept
+  accept
+  accept
+  accept
+  accept

test/subjects.t

@@ -0,0 +1,11 @@
+Test subjects - basic syntax tests
+=====================================
+
+Linear execution test:
+  $ sgen run subjects/linear.sg
+
+Prolog-style test:
+  $ sgen run subjects/prolog.sg
+
+Records test:
+  $ sgen run subjects/records.sg