Recent changes to Examples

Examples modified by David A. Wheeler

David A. Wheeler — Sun, 10 Sep 2017 21:15:13 -0000

--- v41
+++ v42
@@ -244,7 +244,9 @@
 Larger programs
 ===============

-The code distribution comes with "sweeten.sscm"; this is a program that translates traditional S-expressions into sweet-expressions, and is itself written using sweet-expressions.
+The code distribution comes with "sweeten.sscm"; this is a program in Scheme that translates traditional S-expressions into sweet-expressions, and is itself written using sweet-expressions.
+
+The code distribution also comes with "math.slisp"; this is a program in Common Lisp that simplifies math expressions, returning exact results.  Its real purpose is to demonstrate sweet-expressions in Common Lisp.

 "Letterfall" by Alan Manuel Gloria is a game written using sweet-expressions; you can see it here: https://github.com/AmkG/letterfall

Examples modified by David A. Wheeler

David A. Wheeler — Sat, 14 Jun 2014 14:25:26 -0000

--- v40
+++ v41
@@ -144,31 +144,31 @@
             kibi-self-desc  amb('m 'f)
             kibi-lied?      amb(#t #f)
           assert
-           distinct?(list(parent1 parent2))
-          assert
-           if eqv?(kibi 'm)
-               not(kibi-lied?)
-          assert
-           if kibi-lied?
-              xor
-                {eqv?(kibi-self-desc 'm) and eqv?(kibi 'f)}
-                {eqv?(kibi-self-desc 'f) and eqv?(kibi 'm)}
-          assert
-           if not(kibi-lied?)
-              xor
-                {eqv?(kibi-self-desc 'm) and eqv?(kibi 'm)}
-                {eqv?(kibi-self-desc 'f) and eqv?(kibi 'f)}
-          assert
-           if eqv?(parent1 'm)
-              and
-                eqv?(kibi-self-desc 'm)
-                xor
-                 {eqv?(kibi 'f) and eqv?(kibi-lied? #f)}
-                 {eqv?(kibi 'm) and eqv?(kibi-lied? #t)}
-          assert
-           if eqv?(parent1 'f)
-              {eqv?(kibi 'f) and eqv?(kibi-lied? #t)}
-          list(parent1 parent2 kibi)
+            distinct? list(parent1 parent2)
+          assert
+            if eqv?(kibi 'm)
+               not kibi-lied?
+          assert
+            if kibi-lied?
+               xor
+                 {eqv?(kibi-self-desc 'm) and eqv?(kibi 'f)}
+                 {eqv?(kibi-self-desc 'f) and eqv?(kibi 'm)}
+          assert
+            if not(kibi-lied?)
+               xor
+                 {eqv?(kibi-self-desc 'm) and eqv?(kibi 'm)}
+                 {eqv?(kibi-self-desc 'f) and eqv?(kibi 'f)}
+          assert
+            if eqv?(parent1 'm)
+               and
+                 eqv?(kibi-self-desc 'm)
+                 xor
+                   {eqv?(kibi 'f) and eqv?(kibi-lied? #f)}
+                   {eqv?(kibi 'm) and eqv?(kibi-lied? #t)}
+          assert
+            if eqv?(parent1 'f)
+               {eqv?(kibi 'f) and eqv?(kibi-lied? #t)}
+          list parent1 parent2 kibi

     solve-kalotan-puzzle()

Examples modified by David A. Wheeler

David A. Wheeler — Mon, 14 Oct 2013 00:19:45 -0000

--- v39
+++ v40
@@ -1,4 +1,4 @@
-Here are a few examples of sweet-expressions (which include modern-expressions and curly infix), as defined in our [Solution] to the [Problem].  The first few use Scheme; they are followed a Common Lisp example.  This section closes with pointers to other examples.
+Here are a few examples of sweet-expressions (which include modern-expressions and curly infix), as defined in our [Solution] to the [Problem].  The first few use Scheme; they are followed by a Common Lisp example.  This section closes with pointers to other materials.

 # Fib and fact

@@ -209,7 +209,7 @@

 # Decision Learning Example (Common Lisp)

-The notation is not limited to Scheme.  Here's a [some Decision tree learning code](http://www.cs.cmu.edu/afs/cs/project/theo-11/www/decision-trees.lisp) in Common Lisp that accompanies the textbook "Machine Learning," Tom M. Mitchell, McGraw Hill, 1997; a longer fragment is in [Analysis].  It's been rewritten using sweet-expressions:
+The notation is not limited to Scheme.  Here's [some Decision tree learning code](http://www.cs.cmu.edu/afs/cs/project/theo-11/www/decision-trees.lisp) in Common Lisp that accompanies the textbook "Machine Learning," Tom M. Mitchell, McGraw Hill, 1997; a longer fragment is in [Analysis].  It's been rewritten using sweet-expressions:

     defun print.tree (tree &optional (depth 0))

Examples modified by David A. Wheeler

David A. Wheeler — Mon, 14 Oct 2013 00:18:26 -0000

--- v38
+++ v39
@@ -255,4 +255,6 @@

 The page [Hunchentoot-make-docstrings] shows a longer Common Lisp example.

-See our [Tutorial] for how to use our tools to use these notations.
+See [Install-howto] for how to install our tools and code that implements this.
+
+See [Common-lisp-tutorial] and [Scheme-tutorial] for our Common Lisp and Scheme tutorials.

Examples modified by David A. Wheeler

David A. Wheeler — Mon, 13 May 2013 03:23:32 -0000

--- v37
+++ v38
@@ -253,6 +253,6 @@

 The [Analysis] page shows many more examples, in many different Lisp variants.

-
+The page [Hunchentoot-make-docstrings] shows a longer Common Lisp example.

 See our [Tutorial] for how to use our tools to use these notations.

Examples modified by David A. Wheeler

David A. Wheeler — Tue, 07 May 2013 01:52:54 -0000

--- v36
+++ v37
@@ -1,4 +1,4 @@
-Here are a few examples of sweet-expressions (which include modern-expressions and curly infix), as defined in our [Solution] to the [Problem], in Scheme and Common Lisp:
+Here are a few examples of sweet-expressions (which include modern-expressions and curly infix), as defined in our [Solution] to the [Problem].  The first few use Scheme; they are followed a Common Lisp example.  This section closes with pointers to other examples.

 # Fib and fact

@@ -222,7 +222,7 @@
           format t " => ~A~%" second(subtree)
           progn
             terpri()
-            print.tree(second(subtree) {depth + 5})
+            print.tree second(subtree) {depth + 5}

Examples modified by David A. Wheeler

David A. Wheeler — Tue, 07 May 2013 01:50:24 -0000

--- v35
+++ v36
@@ -1,4 +1,4 @@
-Here are a few examples of sweet-expressions (which include modern-expressions and curly infix), as defined in our [Solution] to the [Problem]:
+Here are a few examples of sweet-expressions (which include modern-expressions and curly infix), as defined in our [Solution] to the [Problem], in Scheme and Common Lisp:

 # Fib and fact

WikiPage Examples modified by Alan Manuel Gloria

Alan Manuel Gloria — Fri, 18 Jan 2013 01:17:06 -0000

--- v34
+++ v35
@@ -193,7 +193,7 @@

       define add-if-all-numbers(lst)
-       call/cc $ lambda exit()
+       call/cc $ lambda (exit)
          let loop (lst(lst) sum(0))
            if null?(lst)
              sum

WikiPage Examples modified by David A. Wheeler

David A. Wheeler — Mon, 27 Aug 2012 21:23:04 -0000

--- v33
+++ v34
@@ -241,9 +241,18 @@

+Larger programs +=============== + +The code distribution comes with "sweeten.sscm"; this is a program that translates traditional S-expressions into sweet-expressions, and is itself written using sweet-expressions. + +"Letterfall" by Alan Manuel Gloria is a game written using sweet-expressions; you can see it here: https://github.com/AmkG/letterfall + Other pages =========== The [Analysis] page shows many more examples, in many different Lisp variants. + + See our [Tutorial] for how to use our tools to use these notations.

WikiPage Examples modified by David A. Wheeler

David A. Wheeler — Thu, 23 Aug 2012 12:00:24 -0000

--- v32
+++ v33
@@ -223,10 +223,14 @@
           progn
             terpri()
             print.tree(second(subtree) {depth + 5})
-
+

+ +

     defun tab (n)
       loop for i from 1 to n do format(t " ")
-
+

+ +

     defun classify (instance tree)
       let
         $ val branch