Merge pull request #4 from acook/wv_rework

Square bracket syntax and arbitrary nesting for WV literals

Author: acook

examples/basic_objects.bl

@@ -10,7 +10,7 @@ o-new
 :num print
 
 ;; create a WV slot
-. 'omg hai' print . greet:
+[ 'omg hai' print ] greet:
 ;; call a WV slot
 :greet
 

examples/catting_a_vector.bl

@@ -4,8 +4,8 @@
 ''
 ('a' 'b' 'c' 'd')
 
-. 0 ato swap 0 rmo rot rot cat swap .
-. len 0 eq swap drop .
+[ 0 ato swap 0 rmo rot rot cat swap ]
+[ len 0 eq swap drop ]
 until
 
 drop

examples/fd-read.bl

@@ -3,12 +3,12 @@
 ;; NOTE -> this will block and wait on input!
 
 newq 0 read swap newq      ;; Q for read-queue, hide FD, Q for work-queue
-.
+[
   '' swap                  ;; create empty CV and bring recv Q back to top
-  .. rot swap app swap ..  ;; bring Cv to top, then item, append item, bring Q to top
-  .. deq dup not ..        ;; deq item, dup it, and make it boolean
+  [ rot swap app swap ]    ;; bring Cv to top, then item, append item, bring Q to top
+  [ deq dup not ]          ;; deq item, dup it, and make it boolean
   until                    ;; iterate over read-queue until we get to a nil
   drop drop                ;; drop the EOF nil and read-queue
   enq                      ;; send CV over the other Q to the main thread
-. work                     ;; use work thread for read loop
+] work                     ;; use work thread for read loop
 deq print                  ;; deq will block waiting for a response

examples/logic.bl

@@ -1,10 +1,10 @@
 1
-. 'not zero!' print .
-. 0 eq not .
+[ 'not zero!' print ]
+[ 0 eq not ]
 if
 
 (1 2)
-. 'empty' .
-. 'not empty!' .
-. len 0 eq swap drop .
+[ 'empty' ]
+[ 'not empty!' ]
+[ len 0 eq swap drop ]
 either print

examples/loops.bl

@@ -3,11 +3,11 @@
 5 4 3 2 1            ;; some stuff we're going to reverse
 
 s-new
-. swap push .        ;; take whatever is in he @stack and put it into our user-stack
-.
+[ swap push ]        ;; take whatever is in he @stack and put it into our user-stack
+[
   depth 1 eq         ;; compare the @stack depth with 1
   swap drop          ;; clean up our lingering number
-. until
+] until
 
 $ swap push          ;; promote our user-stack onto the $stack
                      ;; this means the user-stack becomes our new @stack

examples/object-child.bl

@@ -5,7 +5,7 @@ o-new  ;; This will be the parent object
 child  ;; And this creates a child object that checks the parent
 
 swap                     ;; let's add some slots to the parent
-. self print . inspect:  ;; this lets us check out what object we have
+[ self print ] inspect:  ;; this lets us check out what object we have
 
 swap                     ;; bring the child back to the top
 :inspect                 ;; call the inspect slot on the child

examples/object-self.bl

@@ -3,9 +3,9 @@
 o-new
 
 ;; we can use self much like @ inside of slots to refer to the current object
-. self print . inspect:
+[ self print ] inspect:
 :inspect
 
 ;; self also allows you to easily use other slots on the same object
-. 1 2 3 4 5 'I am an object: ' print self :inspect . pp:
+[ 1 2 3 4 5 'I am an object: ' print self :inspect ] pp:
 :pp

examples/print_types.bl

@@ -11,7 +11,7 @@ s-new 1 push 2 push 3 push 4 push print '' print
 ~1 print
 
 'word vectors' print
-. 1 2 3 4 . print '' print
+[ 1 2 3 4 ] print '' print
 
 'char vectors' print
 '1 2 3 4' print '' print

examples/queues.bl

@@ -4,4 +4,4 @@ newq 1 enq
 newq 2 enq
 swap deq print drop
 3 enq 4 enq
-. print . proq
+[ print ] proq

examples/talking_to_threads.bl

@@ -1,18 +1,18 @@
 newq newq                ;; create send and receive queues
-.
-  ..
+[
+  [
     deq                  ;; will block if the queue is empty
-    n-to-cv rot swap enq  ;; convert number into a cv (string) and send back
+    n-to-cv rot swap enq ;; convert number into a cv (string) and send back
     swap                 ;; reorder queues so we can loop without confusion
-  .. loop                ;; using loop since it goes forever
-. work                   ;; start new thread and swap the queues
+  ] loop                 ;; using loop since it goes forever
+] work                   ;; start new thread and swap the queues
 
 swap                     ;; bring send queue to top
 1 enq 2 enq 3 enq 4 enq  ;; send some numbers to be converted
 
 0
-. 1 add .
-. 1000 eq .
+[ 1 add ]
+[ 1000 eq ]
 until drop               ;; give the main thread busywork
 
 swap q-to-v              ;; get contents of receive Q as V