halunke 0.9.0 → 0.10.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 3b782ee6ddb661b1ab07e7beadc086c692572ed3e2aa3a80a33b9c598ed70a93
-  data.tar.gz: f6aa3c8e8984a15ae7593f388354b69b8d9915a544acce6f1911aeebb171c40f
+  metadata.gz: dc3b88ba0756907b466c614c950ea5d9f623ed95ce536afbf714a25c488e982a
+  data.tar.gz: f5132e70c123842d85892d87152fc37a54819c4eca26035ac16bcbac87ee8e9b
 SHA512:
-  metadata.gz: 61e527ced02be4c0a7b182d9838539148be73683c9fe7421c4e55753a882052551f9e5c16a3ee5e7a75b2224ebcaaeb87e19c1eb51a041dd75dffdf93b331791
-  data.tar.gz: 05dc2c4b8f27b6c4a7bae7cf0bd18fbaac19eee8b85bb1c90d0db107ffcc6169eed686c7c3e74e66c3f2f7a0ebd1059200f8740b6e0cadd2ee82e88d77b8687b
+  metadata.gz: 15e3f8586f02ccb75af4f3086e9c044d0ff0e56dd1b4c5a9f700e868f8472feaa8a6f043f303652559b3c592d03dc4eeba922a772e9675d2e46732a9440a8b3f
+  data.tar.gz: bdbbb12cd46e08ce6760d64bc163b0da73b52ee6cbc2aa73d3d0c0b30fa5e99b9e1ce929a05f5128a8ed00b203aaa8873108f20abba2ca6d3b42b05e4a495c82

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    halunke (0.9.0)
+    halunke (0.10.0)
       rack (~> 2.0.4)
 
 GEM

data/docs/index.md

@@ -70,10 +70,10 @@ the value is `["Ha" "Spe"]`.
 If you want to find out more about the types of objects in Halunke
 and the messages you can send to them, explore the navigation bar
 at the top. If you want to learn more about conditionals, check out
-the section about [True & False](/halunke/true-false). If you want
+the section about [True & False](/true-false). If you want
 to write your own functions, check out
-[Function](/halunke/function) and if you want to define your own
-classes, check out [Class](/halunke/class).
+[Function](/function) and if you want to define your own
+classes, check out [Class](/class).
 
 If you want to store an object in a variable, you can do it like this:
 

data/lib/halunke/grammar.y

@@ -27,15 +27,19 @@ rule
   | Expression Expressions { Nodes.new([val[0]].concat(val[1].nodes)) }
   ;
 
+  Arguments:
+    /* empty */         { ArrayNode.new([]) }
+  | BAR Expressions BAR { ArrayNode.new(val[1].nodes, val[0][1], val[2][2]) }
+  ;
+
   Expression:
     NUMBER                                                 { NumberNode.new(*val[0]) }
   | STRING                                                 { StringNode.new(*val[0]) }
   | BAREWORD                                               { BarewordNode.new(*val[0]) }
   | UNASSIGNED_BAREWORD                                    { UnassignedNode.new(BarewordNode.new(*val[0]), val[0][1], val[0][2]) }
   | START_COMMENT Expressions END_COMMENT                  { Nodes.new([]) }
-  | OPEN_CURLY Expressions CLOSE_CURLY                     { FunctionNode.new(ArrayNode.new([]), val[1], val[0][1], val[2][2]) }
-  | OPEN_CURLY BAR Expressions BAR Expressions CLOSE_CURLY { FunctionNode.new(ArrayNode.new(val[2].nodes), val[4], val[0][1], val[5][2]) }
-  | OPEN_PAREN Expression Expressions CLOSE_PAREN          { MessageSendNode.new(val[1], MessageNode.new(val[2].nodes), val[0][1], val[3][2]) }
+  | OPEN_CURLY Arguments Expressions CLOSE_CURLY           { FunctionNode.new(val[1], val[2], val[0][1], val[3][2]) }
+  | OPEN_PAREN Expressions CLOSE_PAREN                     { MessageSendNode.new(val[1].nodes, val[0][1], val[2][2]) }
   | OPEN_BRACKET Expressions CLOSE_BRACKET                 { ArrayNode.new(val[1].nodes, val[0][1], val[2][2]) }
   | OPEN_DICT_BRACKET Expressions CLOSE_BRACKET            { DictionaryNode.new(val[1].nodes, val[0][1], val[2][2]) }
   ;

data/lib/halunke/herror.rb

@@ -48,4 +48,13 @@ module Halunke
 
   class HUnknownAttribute < HError
   end
+
+  class HInvalidMessage < HError
+  end
+
+  class HInvalidDictionary < HError
+  end
+
+  class HInvalidMessageName < HError
+  end
 end

data/lib/halunke/nodes.rb

@@ -11,31 +11,40 @@ module Halunke
 
   NumberNode = Struct.new(:value, :ts, :te) do
     def eval(context)
-      context["Number"].create_instance(value)
+      context["Number"].create_instance(value,
+                                        source_code_position: source_code_position)
     end
 
     def ==(other)
       other.is_a?(NumberNode) &&
         value == other.value
     end
+
+    def source_code_position
+      SourceCodePosition.new(ts, te)
+    end
   end
 
   StringNode = Struct.new(:value, :ts, :te) do
     def eval(context)
-      context["String"].create_instance(value)
+      context["String"].create_instance(value,
+                                        source_code_position: source_code_position)
     end
 
     def ==(other)
       other.is_a?(StringNode) &&
         value == other.value
     end
+
+    def source_code_position
+      SourceCodePosition.new(ts, te)
+    end
   end
 
   BarewordNode = Struct.new(:value, :ts, :te) do
     def eval(context)
       context[value]
     rescue KeyError
-      source_code_position = SourceCodePosition.new(ts, te)
       raise HUnassignedBareword.new("Bareword '#{value} is unassigned", source_code_position)
     end
 
@@ -43,22 +52,30 @@ module Halunke
       other.is_a?(BarewordNode) &&
         value == other.value
     end
+
+    def source_code_position
+      SourceCodePosition.new(ts, te)
+    end
   end
 
   UnassignedNode = Struct.new(:node, :ts, :te) do
     def eval(context)
-      context["UnassignedBareword"].create_instance(node.value, source_code_position: SourceCodePosition.new(ts, te))
+      context["UnassignedBareword"].create_instance(node.value, source_code_position: source_code_position)
     end
 
     def ==(other)
       other.is_a?(UnassignedNode) &&
         node == other.node
     end
+
+    def source_code_position
+      SourceCodePosition.new(ts, te)
+    end
   end
 
   FunctionNode = Struct.new(:params, :body, :ts, :te) do
     def eval(context)
-      raise HEmptyFunction.new("This function would not return anything, in Halunke every function needs to return something.", SourceCodePosition.new(ts, te)) if body.empty?
+      raise HEmptyFunction.new("This function would not return anything, in Halunke every function needs to return something.", source_code_position) if body.empty?
       signature = params.nodes.map(&:node).map(&:value)
 
       context["Function"].new(signature, lambda { |call_context|
@@ -71,6 +88,10 @@ module Halunke
         params == other.params &&
         body == other.body
     end
+
+    def source_code_position
+      SourceCodePosition.new(ts, te)
+    end
   end
 
   ArrayNode = Struct.new(:nodes, :ts, :te) do
@@ -82,56 +103,79 @@ module Halunke
       other.is_a?(ArrayNode) &&
         nodes == other.nodes
     end
+
+    def source_code_position
+      SourceCodePosition.new(ts, te)
+    end
   end
 
   DictionaryNode = Struct.new(:nodes, :ts, :te) do
     def eval(context)
       hash = {}
       nodes.each_slice(2) do |key, value|
+        raise HInvalidDictionary.new("This key has no value", key.source_code_position) if value.nil?
         hash[key.eval(context)] = value.eval(context)
       end
-      context["Dictionary"].create_instance(hash)
+      context["Dictionary"].create_instance(hash,
+                                            source_code_position: source_code_position)
     end
 
     def ==(other)
       other.is_a?(DictionaryNode) &&
         nodes == other.nodes
     end
+
+    def source_code_position
+      SourceCodePosition.new(ts, te)
+    end
   end
 
-  MessageSendNode = Struct.new(:receiver, :message, :ts, :te) do
+  MessageSendNode = Struct.new(:nodes, :ts, :te) do
     def eval(context)
-      receiver.eval(context).receive_message(context, *message.eval(context),
-                                             source_code_position: SourceCodePosition.new(ts, te))
+      message_name, message_value = parse_message(context)
+      receiver.eval(context).receive_message(context, message_name, message_value,
+                                             source_code_position: source_code_position)
     end
 
     def ==(other)
       other.is_a?(MessageSendNode) &&
-        receiver == other.receiver &&
-        message == other.message
+        nodes == other.nodes
     end
-  end
 
-  MessageNode = Struct.new(:nodes) do
-    def eval(context)
-      if nodes.length == 1
-        if nodes[0].is_a? NumberNode
-          # hack to allow expressions like (1+5)
-          ["+", [nodes[0].eval(context)]]
-        else
-          [nodes[0].value, []]
-        end
-      elsif nodes.length.even?
-        name = []
-        message = []
-        nodes.each_slice(2) do |name_part, value|
-          name.push(name_part.value)
-          message.push(value.eval(context))
-        end
-        [name.join(" "), message]
-      else
-        raise "Parse Error"
+    def source_code_position
+      SourceCodePosition.new(ts, te)
+    end
+
+    private
+
+    def receiver
+      raise HInvalidMessage.new("This message has no receiver", source_code_position) if nodes.length == 0
+      @receiver ||= nodes[0]
+    end
+
+    def parse_message(context)
+      if message_nodes.length == 1
+        # hack to allow expressions like (1+5)
+        return ["+", [message_nodes[0].eval(context)]] if message_nodes[0].is_a? NumberNode
+        return [message_nodes[0].value, []] if message_nodes[0].is_a? BarewordNode
+
+        raise HInvalidMessage.new("This is not a bareword", message_nodes[0].source_code_position)
+      end
+
+      name = []
+      message = []
+      message_nodes.each_slice(2) do |name_part, value|
+        raise HInvalidMessage.new("This is not a bareword", name_part.source_code_position) unless name_part.is_a? BarewordNode
+        raise HInvalidMessage.new("This bareword has no according argument", name_part.source_code_position) if value.nil?
+        name << name_part
+        message << value
       end
+      [name.map(&:value).join(" "), message.map { |node| node.eval(context) }]
+    end
+
+    def message_nodes
+      raise HInvalidMessage.new("You are sending an empty message", source_code_position) if nodes.length == 1
+      @message_nodes ||= nodes.drop(1)
     end
   end
 end

data/lib/halunke/parser.rb

@@ -13,7 +13,7 @@ require "halunke/nodes"
 module Halunke
   class Parser < Racc::Parser
 
-module_eval(<<'...end grammar.y/module_eval...', 'grammar.y', 50)
+module_eval(<<'...end grammar.y/module_eval...', 'grammar.y', 54)
 
 def parse(code)
   @tokens = Tokenizer.new.tokenize(code)
@@ -27,82 +27,75 @@ end
 ##### State transition tables begin ###
 
 racc_action_table = [
-     4,     5,     6,    10,    13,     9,    21,     7,    11,    22,
-    12,    23,     8,     4,     5,     6,    10,    26,     9,    27,
-     7,    11,    28,    12,    29,     8,     4,     5,     6,    10,
-    31,     9,   nil,     7,    11,   nil,    12,   nil,     8,     4,
+     4,     5,     6,    10,    13,     9,    16,     7,    11,    21,
+    12,    22,     8,     4,     5,     6,    10,    25,     9,    26,
+     7,    11,    27,    12,    28,     8,     4,     5,     6,    10,
+    29,     9,   nil,     7,    11,   nil,    12,   nil,     8,     4,
      5,     6,    10,   nil,     9,   nil,     7,    11,   nil,    12,
-    17,     8,     4,     5,     6,    10,   nil,     9,   nil,     7,
+   nil,     8,     4,     5,     6,    10,   nil,     9,   nil,     7,
     11,   nil,    12,   nil,     8,     4,     5,     6,    10,   nil,
      9,   nil,     7,    11,   nil,    12,   nil,     8,     4,     5,
      6,    10,   nil,     9,   nil,     7,    11,   nil,    12,   nil,
      8,     4,     5,     6,    10,   nil,     9,   nil,     7,    11,
-   nil,    12,   nil,     8,     4,     5,     6,    10,   nil,     9,
-   nil,     7,    11,   nil,    12,   nil,     8,     4,     5,     6,
-    10,   nil,     9,   nil,     7,    11,   nil,    12,   nil,     8 ]
+   nil,    12,   nil,     8 ]
 
 racc_action_check = [
-     0,     0,     0,     0,     1,     0,    13,     0,     0,    15,
-     0,    16,     0,     3,     3,     3,     3,    19,     3,    20,
-     3,     3,    24,     3,    25,     3,     8,     8,     8,     8,
-    30,     8,   nil,     8,     8,   nil,     8,   nil,     8,     9,
-     9,     9,     9,   nil,     9,   nil,     9,     9,   nil,     9,
-     9,     9,    10,    10,    10,    10,   nil,    10,   nil,    10,
-    10,   nil,    10,   nil,    10,    11,    11,    11,    11,   nil,
-    11,   nil,    11,    11,   nil,    11,   nil,    11,    12,    12,
-    12,    12,   nil,    12,   nil,    12,    12,   nil,    12,   nil,
-    12,    17,    17,    17,    17,   nil,    17,   nil,    17,    17,
-   nil,    17,   nil,    17,    18,    18,    18,    18,   nil,    18,
-   nil,    18,    18,   nil,    18,   nil,    18,    28,    28,    28,
-    28,   nil,    28,   nil,    28,    28,   nil,    28,   nil,    28 ]
+     0,     0,     0,     0,     1,     0,     9,     0,     0,    13,
+     0,    15,     0,     3,     3,     3,     3,    18,     3,    19,
+     3,     3,    20,     3,    23,     3,     8,     8,     8,     8,
+    24,     8,   nil,     8,     8,   nil,     8,   nil,     8,    10,
+    10,    10,    10,   nil,    10,   nil,    10,    10,   nil,    10,
+   nil,    10,    11,    11,    11,    11,   nil,    11,   nil,    11,
+    11,   nil,    11,   nil,    11,    12,    12,    12,    12,   nil,
+    12,   nil,    12,    12,   nil,    12,   nil,    12,    16,    16,
+    16,    16,   nil,    16,   nil,    16,    16,   nil,    16,   nil,
+    16,    17,    17,    17,    17,   nil,    17,   nil,    17,    17,
+   nil,    17,   nil,    17 ]
 
 racc_action_pointer = [
-    -2,     4,   nil,    11,   nil,   nil,   nil,   nil,    24,    37,
-    50,    63,    76,     6,   nil,    -6,     3,    89,   102,     6,
-     8,   nil,   nil,   nil,     9,    18,   nil,   nil,   115,   nil,
-    22,   nil ]
+    -2,     4,   nil,    11,   nil,   nil,   nil,   nil,    24,    -7,
+    37,    50,    63,     9,   nil,    -4,    76,    89,    11,     8,
+    11,   nil,   nil,    11,    22,   nil,   nil,   nil,   nil,   nil ]
 
 racc_action_default = [
-    -2,   -14,    -1,    -2,    -4,    -5,    -6,    -7,    -2,    -2,
-   -14,    -2,    -2,   -14,    -3,   -14,   -14,    -2,    -2,   -14,
-   -14,    32,    -8,    -9,   -14,   -14,   -12,   -13,    -2,   -11,
-   -14,   -10 ]
+    -2,   -15,    -1,    -2,    -6,    -7,    -8,    -9,    -2,    -4,
+    -2,    -2,    -2,   -15,    -3,   -15,    -2,    -2,   -15,   -15,
+   -15,    30,   -10,   -15,   -15,   -12,   -13,   -14,    -5,   -11 ]
 
 racc_goto_table = [
-     2,     1,    18,    14,   nil,   nil,   nil,   nil,    15,    16,
-   nil,    19,    20,   nil,   nil,   nil,   nil,    24,    25,   nil,
-   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,    30 ]
+     2,     1,    17,    14,   nil,   nil,   nil,   nil,    15,   nil,
+    18,    19,    20,   nil,   nil,   nil,    23,    24 ]
 
 racc_goto_check = [
-     2,     1,     3,     2,   nil,   nil,   nil,   nil,     2,     2,
-   nil,     2,     2,   nil,   nil,   nil,   nil,     2,     2,   nil,
-   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,     2 ]
+     2,     1,     4,     2,   nil,   nil,   nil,   nil,     2,   nil,
+     2,     2,     2,   nil,   nil,   nil,     2,     2 ]
 
 racc_goto_pointer = [
-   nil,     1,     0,    -8 ]
+   nil,     1,     0,   nil,    -7 ]
 
 racc_goto_default = [
-   nil,   nil,   nil,     3 ]
+   nil,   nil,   nil,     3,   nil ]
 
 racc_reduce_table = [
   0, 0, :racc_error,
   1, 17, :_reduce_1,
   0, 18, :_reduce_2,
   2, 18, :_reduce_3,
-  1, 19, :_reduce_4,
-  1, 19, :_reduce_5,
+  0, 20, :_reduce_4,
+  3, 20, :_reduce_5,
   1, 19, :_reduce_6,
   1, 19, :_reduce_7,
-  3, 19, :_reduce_8,
-  3, 19, :_reduce_9,
-  6, 19, :_reduce_10,
+  1, 19, :_reduce_8,
+  1, 19, :_reduce_9,
+  3, 19, :_reduce_10,
   4, 19, :_reduce_11,
   3, 19, :_reduce_12,
-  3, 19, :_reduce_13 ]
+  3, 19, :_reduce_13,
+  3, 19, :_reduce_14 ]
 
-racc_reduce_n = 14
+racc_reduce_n = 15
 
-racc_shift_n = 32
+racc_shift_n = 30
 
 racc_token_table = {
   false => 0,
@@ -162,7 +155,8 @@ Racc_token_to_s_table = [
   "$start",
   "Program",
   "Expressions",
-  "Expression" ]
+  "Expression",
+  "Arguments" ]
 
 Racc_debug_parser = false
 
@@ -190,60 +184,66 @@ module_eval(<<'.,.,', 'grammar.y', 26)
 
 module_eval(<<'.,.,', 'grammar.y', 30)
   def _reduce_4(val, _values)
-     NumberNode.new(*val[0]) 
+     ArrayNode.new([]) 
   end
 .,.,
 
 module_eval(<<'.,.,', 'grammar.y', 31)
   def _reduce_5(val, _values)
-     StringNode.new(*val[0]) 
+     ArrayNode.new(val[1].nodes, val[0][1], val[2][2]) 
   end
 .,.,
 
-module_eval(<<'.,.,', 'grammar.y', 32)
+module_eval(<<'.,.,', 'grammar.y', 35)
   def _reduce_6(val, _values)
-     BarewordNode.new(*val[0]) 
+     NumberNode.new(*val[0]) 
   end
 .,.,
 
-module_eval(<<'.,.,', 'grammar.y', 33)
+module_eval(<<'.,.,', 'grammar.y', 36)
   def _reduce_7(val, _values)
-     UnassignedNode.new(BarewordNode.new(*val[0]), val[0][1], val[0][2]) 
+     StringNode.new(*val[0]) 
   end
 .,.,
 
-module_eval(<<'.,.,', 'grammar.y', 34)
+module_eval(<<'.,.,', 'grammar.y', 37)
   def _reduce_8(val, _values)
-     Nodes.new([]) 
+     BarewordNode.new(*val[0]) 
   end
 .,.,
 
-module_eval(<<'.,.,', 'grammar.y', 35)
+module_eval(<<'.,.,', 'grammar.y', 38)
   def _reduce_9(val, _values)
-     FunctionNode.new(ArrayNode.new([]), val[1], val[0][1], val[2][2]) 
+     UnassignedNode.new(BarewordNode.new(*val[0]), val[0][1], val[0][2]) 
   end
 .,.,
 
-module_eval(<<'.,.,', 'grammar.y', 36)
+module_eval(<<'.,.,', 'grammar.y', 39)
   def _reduce_10(val, _values)
-     FunctionNode.new(ArrayNode.new(val[2].nodes), val[4], val[0][1], val[5][2]) 
+     Nodes.new([]) 
   end
 .,.,
 
-module_eval(<<'.,.,', 'grammar.y', 37)
+module_eval(<<'.,.,', 'grammar.y', 40)
   def _reduce_11(val, _values)
-     MessageSendNode.new(val[1], MessageNode.new(val[2].nodes), val[0][1], val[3][2]) 
+     FunctionNode.new(val[1], val[2], val[0][1], val[3][2]) 
   end
 .,.,
 
-module_eval(<<'.,.,', 'grammar.y', 38)
+module_eval(<<'.,.,', 'grammar.y', 41)
   def _reduce_12(val, _values)
-     ArrayNode.new(val[1].nodes, val[0][1], val[2][2]) 
+     MessageSendNode.new(val[1].nodes, val[0][1], val[2][2]) 
   end
 .,.,
 
-module_eval(<<'.,.,', 'grammar.y', 39)
+module_eval(<<'.,.,', 'grammar.y', 42)
   def _reduce_13(val, _values)
+     ArrayNode.new(val[1].nodes, val[0][1], val[2][2]) 
+  end
+.,.,
+
+module_eval(<<'.,.,', 'grammar.y', 43)
+  def _reduce_14(val, _values)
      DictionaryNode.new(val[1].nodes, val[0][1], val[2][2]) 
   end
 .,.,

data/lib/halunke/runtime/hclass.rb

@@ -39,12 +39,15 @@ module Halunke
           end
 
           context[name] = HClass.new(name, allowed_attributes, instance_methods, class_methods, false)
+        rescue FrozenError
+          assigned_value = context[name].inspect(context)
+          raise HBarewordAlreadyAssigned.new("Bareword '#{name} is already assigned to #{assigned_value}. In Halunke, you can only assign once.", message_value[0].source_code_position)
         end
 
         private
 
-        def determine_name(hstring)
-          hstring.ruby_value
+        def determine_name(unassigned_bareword)
+          unassigned_bareword.ruby_value
         end
 
         def determine_allowed_attributes(harray)
@@ -64,6 +67,12 @@ module Halunke
             })
           }
           hdictionary.ruby_value.each_pair do |method_name, fn|
+            raise HInvalidMessageName.new("Message name must be a String", method_name.source_code_position) unless method_name.runtime_class.name == "String"
+            raise HInvalidMessageName.new("An empty String is not a valid message", method_name.source_code_position) if method_name.ruby_value == ""
+            raise HInvalidMessageName.new("A message can't start with a space", method_name.source_code_position) if method_name.ruby_value.start_with? " "
+            raise HInvalidMessageName.new("A message can't stop with a space", method_name.source_code_position) if method_name.ruby_value.end_with? " "
+            raise HInvalidMessageName.new("The parts of the message need to be separated by a single space", method_name.source_code_position) if method_name.ruby_value.match(/ {2,}/)
+
             instance_methods[method_name.ruby_value] = fn
           end
           instance_methods

data/lib/halunke/version.rb

@@ -1,3 +1,3 @@
 module Halunke
-  VERSION = "0.9.0"
+  VERSION = "0.10.0"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: halunke
 version: !ruby/object:Gem::Version
-  version: 0.9.0
+  version: 0.10.0
 platform: ruby
 authors:
 - Lucas Dohmen
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2019-03-05 00:00:00.000000000 Z
+date: 2019-03-17 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rack