Whitespace: added Euclidian algorithm (#415)

* Whitespace: added Euclidian algorithm

* Euclid_mod was corrupted, replaced it

* Added the end at the end of the file for gitbook formatting

* Fixed sub method and added comments

* Added comments to .md file

Author: jiegillet

.editorconfig

@@ -110,6 +110,14 @@ indent_size = 2
 indent_style = space
 indent_size = 4
 
+# Whitespace
+[*.ws]
+indent_style = space
+indent_size = 0
+trim_trailing_whitespace = false
+insert_final_newline = false
+end_of_line = lf
+
 # Emojicode
 [*.emojic]
 indent_style = space

book.json

@@ -144,6 +144,10 @@
           "lang": "f90",
           "name": "Fortran90"
         },
+        {
+          "lang": "ws",
+          "name": "Whitespace"
+        },
         {
           "lang": "scala",
           "name": "Scala"

contents/euclidean_algorithm/code/whitespace/euclidian_mod.ws

@@ -0,0 +1,28 @@
+Euclidian algorithm modulo method.
+Enter two positive integers.	
+	
+			
+		
+  
+   
+			 
+ 
+	 	
+   	
+			 
+		 		   
+			   	
+ 
+			    
+ 
+			 
+ 
+
+
+  	
+   	
+				
+ 	
+
+The
+end.

contents/euclidean_algorithm/code/whitespace/euclidian_mod_comments.ws

@@ -0,0 +1,32 @@
+Reading the input: a, b
+[SPACE][SPACE][SPACE][LF]       push 0
+[SPACE][SPACE][SPACE][TAB][LF]  push 1
+[TAB][LF][TAB][TAB]             readi
+[TAB][LF][TAB][TAB]             readi
+
+Loop: a, b => b, a%b
+[LF][SPACE][SPACE][LF]          label_0:
+[SPACE][SPACE][SPACE][LF]         push 0
+[TAB][TAB][TAB]                   retrieve
+[SPACE][LF][SPACE]                dup
+[LF][TAB][SPACE][TAB][LF]         jmp zero label_1
+[SPACE][SPACE][SPACE][TAB][LF]    push 1
+[TAB][TAB][TAB]                   retrieve
+[SPACE][LF][TAB]                  swap
+[TAB][SPACE][TAB][TAB]            mod
+[SPACE][SPACE][SPACE][LF]         push 0
+[TAB][TAB][TAB]                   retrieve
+[SPACE][SPACE][SPACE][TAB][LF]    push 1
+[SPACE][LF][TAB]                  swap
+[TAB][TAB][SPACE]                 store
+[SPACE][SPACE][SPACE][LF]         push 0
+[SPACE][LF][TAB]                  swap
+[TAB][TAB][SPACE]                 store
+[LF][SPACE][LF][LF]               jmp label_0
+
+Exit when b=0
+[LF][SPACE][SPACE][TAB][LF]     label_1:
+[SPACE][SPACE][SPACE][TAB][LF]    push 1
+[TAB][TAB][TAB]                   retrieve
+[TAB][LF][SPACE][TAB]             printi
+[LF][LF][LF][LF]                  end

contents/euclidean_algorithm/code/whitespace/euclidian_sub.ws

@@ -0,0 +1,36 @@
+Euclidian algorithm subtraction method.
+Enter two positive integers.	
+	
+			
+		
+  			  	    
+   
+			   	
+				  	 
+ 
+	 			  	   	
+ 
+ 
+					  	  	 
+   
+ 
+			 
+ 
+			  	    
+
+  			  	   	
+   
+				
+ 	
+
+
+
+  			  	  	 
+   
+ 
+		  	   	
+ 
+			 
+ 
+The			  	    
+end.

contents/euclidean_algorithm/code/whitespace/euclidian_sub_comments.ws

@@ -0,0 +1,38 @@
+Reading the input: a, b
+[SPACE][SPACE][SPACE][LF]            push 0
+[SPACE][SPACE][SPACE][TAB][LF]       push 1
+[TAB][LF][TAB][TAB]                  readi
+[TAB][LF][TAB][TAB]                  readi
+
+Loop: a, b => a, b-a
+[LF][SPACE][SPACE][LF]               label_0:
+[SPACE][SPACE][SPACE][LF]              push 0
+[TAB][TAB][TAB]                        retrieve
+[SPACE][SPACE][SPACE][TAB][LF]         push 1
+[TAB][TAB][TAB]                        retrieve
+[TAB][SPACE][SPACE][TAB]               sub
+[SPACE][LF][SPACE]                     dup
+[LF][TAB][SPACE][TAB][LF]              jmp zero label_1
+[SPACE][LF][SPACE]                     dup
+[LF][TAB][TAB][TAB][SPACE][LF]         jmp neg label_2
+[SPACE][SPACE][SPACE][LF]              push 0
+[SPACE][LF][TAB]                       swap
+[TAB][TAB][SPACE]                      store
+[LF][SPACE][LF][LF]                    jmp label_0
+
+Exit when a=b
+[LF][SPACE][SPACE][TAB][LF]          label_1:
+[SPACE][SPACE][SPACE][LF]              push 0
+[TAB][TAB][TAB]                        retrieve
+[TAB][LF][SPACE][TAB]                  printi
+[LF][LF][LF]                           end
+
+If a>b: a, b => a-b, b
+[LF][SPACE][SPACE][TAB][SPACE][LF]   label_2:
+[SPACE][SPACE][SPACE][LF]              push 0
+[SPACE][LF][TAB]                       swap
+[TAB][SPACE][SPACE][TAB]               sub
+[SPACE][SPACE][SPACE][TAB][LF]         push 1
+[SPACE][LF][TAB]                       swap
+[TAB][TAB][SPACE]                      store
+[LF][SPACE][LF][LF]                    jmp label_0

contents/euclidean_algorithm/euclidean_algorithm.md

@@ -41,6 +41,8 @@ The algorithm is a simple way to find the *greatest common divisor* (GCD) of two
 [import:13-24, lang="nim"](code/nim/euclid_algorithm.nim)
 {% sample lang="f90" %}
 [import:1-19, lang="fortran"](code/fortran/euclidean.f90)
+{% sample lang="ws" %}
+[import, lang="whitespace"](code/whitespace/euclidian_sub.ws)
 {% sample lang="scala" %}
 [import:3-8, lang="scala"](code/scala/euclidean.scala)
 {% sample lang="racket" %}
@@ -96,6 +98,8 @@ Modern implementations, though, often use the modulus operator (%) like so
 [import:1-11, lang="nim"](code/nim/euclid_algorithm.nim)
 {% sample lang="f90" %}
 [import:21-34, lang="fortran"](code/fortran/euclidean.f90)
+{% sample lang="ws" %}
+[import, lang="whitespace"](code/whitespace/euclidian_mod.ws)
 {% sample lang="scala" %}
 [import:10-14, lang="scala"](code/scala/euclidean.scala)
 {% sample lang="racket" %}
@@ -156,6 +160,11 @@ The Euclidean Algorithm is truly fundamental to many other algorithms throughout
 [import, lang="nim" %](code/nim/euclid_algorithm.nim)
 {% sample lang="f90" %}
 [import, lang="fortran"](code/fortran/euclidean.f90)
+{% sample lang="ws" %}
+Here is a readable version of the algorithms with comments. First, subtraction method:
+[import, lang="whitespace"](code/whitespace/euclidian_sub_comments.ws)
+and modulo method:
+[import, lang="whitespace"](code/whitespace/euclidian_mod_comments.ws)
 {% sample lang="scala" %}
 [import, lang="scala"](code/scala/euclidean.scala)
 {% sample lang="racket" %}