diff --git a/docs/html/images/grammar.png b/docs/html/images/grammar.png
new file mode 100644
index 0000000..2c9d995
Binary files /dev/null and b/docs/html/images/grammar.png differ
diff --git a/docs/source/Thun.md b/docs/source/Thun.md
index 901f532..bbfe5d0 100644
--- a/docs/source/Thun.md
+++ b/docs/source/Thun.md
@@ -13,7 +13,7 @@ notation, Booleans `true` and `false`, lists enclosed by square brackets
     
     term ::= integer | bool | '[' joy ']' | symbol
     
-    integer ::= [ '-' ] ('0'...'9')+
+    integer ::= 0 | [ '-' ] ('1'...'9') ('0'...'9')*
     
     bool ::= 'true' | 'false'
     
@@ -29,6 +29,9 @@ respective Boolean values.
 That's it.  That's the whole of the grammar.
 
 
+![Thun Grammar Railroad Diagram](./images/grammar.png)
+
+
 ## Types
 
 The original Joy has several datatypes (such as strings and sets)