turmali 0.0.3 → 0.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 75974b5214de62ac8e5c6f8d7adae49d6039834e
-  data.tar.gz: 67991b4258c5b5f2f90961c14f44f531a8f02f03
+  metadata.gz: 9933a3719549c259b1563d70bbd652554aae16d9
+  data.tar.gz: 317bbc633bc618b4b249119a045f51fd7b3ce12d
 SHA512:
-  metadata.gz: c0216246bc2cc359ba1daf650a3e6ddbb1224c4c5950e7384f4d710f3e8935a5141d9af6cb816068c4984854303960ca8ebb9f338c4254a4aad461d14c919796
-  data.tar.gz: e38c41b1ac77d3d2f9aba43f5902d0d6f7524a71b943e2df1c22f3b04f86fa3a969b6d1527201ca43cab7e651fdddbd4245e2f29380b86e101e3c41740bb8bae
+  metadata.gz: 291ff83a3a34dc538dfadf989a34b678941a331ceb17e1c00779ac951af724511b9e8ed5bc17dc5568ad1df42ca1cbcdea84824719b364e9a306f67440d352cc
+  data.tar.gz: 56449014334e5e508cdd717c4a64f8076711e3e8491ebb0c3c9ff11c97e8b7653f1b0d8fa1ce45a82558047a9f6108eabc4733b9df2e4662edc28bf203c1de62

data/lib/turmali/grammar.y

@@ -1,5 +1,7 @@
 class Parser
 
+# We need to tell the parser what tokens to expect. So each type of token produced
+# by our lexer needs to be declared here.
 token IF
 token DEF
 token CLASS
@@ -10,7 +12,11 @@ token TRUE FALSE NIL
 token IDENTIFIER
 token CONSTANT
 token INDENT DEDENT
+token WHILE
 
+# Here is the Operator Precedence Table. As presented before, it tells the parser in
+# which order to parse expressions containing operators.
+# This table is based on the [C and C++ Operator Precedence Table](http://en.wikipedia.org/wiki/Operators_in_C_and_C%2B%2B#Operator_precedence).
 prechigh
   left  '.'
   right '!'
@@ -24,13 +30,41 @@ prechigh
   left  ','
 preclow
 
-
+# In the following `rule` section, we define the parsing rules.
+# All rules are declared using the following format:
+#
+#     RuleName:
+#       OtherRule TOKEN AnotherRule    { result = Node.new }
+#     | OtherRule                      { ... }
+#     ;
+#
+# In the action section (inside the `{...}` on the right), you can do the following:
+#
+# * Assign to `result` the value returned by the rule, usually a node for the AST.
+# * Use `val[index of expression]` to get the `result` of a matched
+#   expressions on the left.
 rule
+  # First, parsers are dumb, we need to explicitly tell it how to handle empty
+  # programs. This is what the first rule does. Note that everything between `/* ... */` is
+  # a comment.
   Program:
     /* nothing */                      { result = Nodes.new([]) }
   | Expressions                        { result = val[0] }
   ;
   
+  # Next, we define what a list of expressions is. Simply put, it's series of expressions separated by a
+  # terminator (a new line or `;` as defined later). But once again, we need to explicitly
+  # define how to handle trailing and orphans line breaks (the last two lines).
+  #
+  # One very powerful trick we'll use to define variable rules like this one
+  # (rules which can match any number of tokens) is *left-recursion*. Which means we reference
+  # the rule itself, directly or indirectly, on the left side **only**. This is true for the current
+  # type of parser we're using (LR). For other types of parsers like ANTLR (LL), it's the opposite,
+  # you can only use right-recursion.
+  #
+  # As you'll see bellow, the `Expressions` rule references `Expressions` itself.
+  # In other words, a list of expressions can be another list of expressions followed by
+  # another expression.
   Expressions:
     Expression                         { result = Nodes.new(val) }
   | Expressions Terminator Expression  { result = val[0] << val[2] }
@@ -38,6 +72,7 @@ rule
   | Terminator                         { result = Nodes.new([]) }
   ;
 
+  # Every type of expression supported by our language is defined here.
   Expression:
     Literal
   | Call
@@ -49,14 +84,24 @@ rule
   | Def
   | Class
   | If
+  | While  
   | '(' Expression ')'    { result = val[1] }
   ;
 
+  # Notice how we implement support for parentheses using the previous rule. 
+  # `'(' Expression ')'` will force the parsing of `Expression` in its
+  # entirety first. Parentheses will then be discarded leaving only the fully parsed expression.
+  #
+  # Terminators are tokens that can terminate an expression.
+  # When using tokens to define rules, we simply reference them by their type which we defined in
+  # the lexer.
   Terminator:
     NEWLINE
   | ";"
   ;
-
+  
+  # Literals are the hard-coded values inside the program. If you want to add support
+  # for other literal types, such as arrays or hashes, this it where you'd do it.
   Literal:
     NUMBER                        { result = NumberNode.new(val[0]) }
   | STRING                        { result = StringNode.new(val[0]) }
@@ -64,7 +109,15 @@ rule
   | FALSE                         { result = FalseNode.new }
   | NIL                           { result = NilNode.new }
   ;
-
+  
+  # Method calls can take three forms:
+  #
+  # * Without a receiver (`self` is assumed): `method(arguments)`.
+  # * With a receiver: `receiver.method(arguments)`.
+  # * And a hint of syntactic sugar so that we can drop
+  #   the `()` if no arguments are given: `receiver.method`.
+  #
+  # Each one of those is handled by the following rule.
   Call:
     IDENTIFIER Arguments          { result = CallNode.new(nil, val[0], val[1]) }
   | Expression "." IDENTIFIER
@@ -82,6 +135,13 @@ rule
   | ArgList "," Expression        { result = val[0] << val[2] }
   ;
   
+
+  # In our language, like in Ruby, operators are converted to method calls.
+  # So `1 + 2` will be converted to `1.+(2)`.
+  # `1` is the receiver of the `+` method call, passing `2`
+  # as an argument.
+  # Operators need to be defined individually for the Operator Precedence Table to take
+  # action.
   Operator:
     Expression '||' Expression  { result = CallNode.new(val[0], val[1], [val[2]]) }
   | Expression '&&' Expression  { result = CallNode.new(val[0], val[1], [val[2]]) }
@@ -97,6 +157,7 @@ rule
   | Expression '/'  Expression  { result = CallNode.new(val[0], val[1], [val[2]]) }
   ;
   
+  # Then we have rules for getting and setting values of constants and local variables.
   GetConstant:
     CONSTANT                      { result = GetConstantNode.new(val[0]) }
   ;
@@ -113,10 +174,20 @@ rule
     IDENTIFIER "=" Expression     { result = SetLocalNode.new(val[0], val[2]) }
   ;
 
+  # Our language uses indentation to separate blocks of code. But the lexer took care of all
+  # that complexity for us and wrapped all blocks in `INDENT ... DEDENT`. A block
+  # is simply an increment in indentation followed by some code and closing with an equivalent
+  # decrement in indentation.
+  # 
+  # If you'd like to use curly brackets or `end` to delimit blocks instead, you'd
+  # simply need to modify this one rule.
+  # You'll also need to remove the indentation logic from the lexer.
   Block:
     INDENT Expressions DEDENT     { result = val[1] }
   ;
-
+  
+  # The `def` keyword is used for defining methods. Once again, we're introducing
+  # a bit of syntactic sugar here to allow skipping the parentheses when there are no parameters.
   Def:
     DEF IDENTIFIER Block          { result = DefNode.new(val[1], [], val[2]) }
   | DEF IDENTIFIER
@@ -128,16 +199,25 @@ rule
   | IDENTIFIER                    { result = val }
   | ParamList "," IDENTIFIER      { result = val[0] << val[2] }
   ;
-
+  
+  # Class definition is similar to method definition.
+  # Class names are also constants because they start with a capital letter.
   Class:
     CLASS CONSTANT Block          { result = ClassNode.new(val[1], val[2]) }
   ;
-
+  
+  # Finally, `if` is similar to `class` but receives a *condition*.
   If:
     IF Expression Block           { result = IfNode.new(val[1], val[2]) }
   ;
+
+  While:
+    WHILE Expression Block           { result = WhileNode.new(val[1], val[2]) }
+  ;
 end
 
+# The final code at the bottom of this Racc file will be put as-is in the generated `Parser` class.
+# You can put some code at the top (`header`) and some inside the class (`inner`).
 ---- header
   require "turmali/lexer"
   require "turmali/nodes"

data/lib/turmali/interpreter.rb

@@ -1,9 +1,9 @@
-require "turmali/parser"
+require "turmali/runtime/bootstrap"
 require "turmali/runtime/object"
 require "turmali/runtime/method"
 require "turmali/runtime/context"
 require "turmali/runtime/class"
-require "turmali/runtime/bootstrap"
+require "turmali/parser"
 
 class Interpreter
   def initialize
@@ -123,4 +123,13 @@ class IfNode
       Constants["nil"]
     end
   end
+end
+
+class WhileNode
+  def eval(context)
+    while @condition.eval(context).ruby_value
+      @body.eval(context)
+    end
+    Constants["nil"]
+  end
 end

data/lib/turmali/lexer.rb

@@ -8,7 +8,7 @@ class Lexer
 
     current_indent = 0 
     indent_stack = []
-
+    
     i = 0 
     while i < code.size
       chunk = code[i..-1]
@@ -20,7 +20,7 @@ class Lexer
           tokens << [:IDENTIFIER, identifier]
         end
         i += identifier.size 
-      
+
       elsif constant = chunk[/\A([A-Z]\w*)/, 1]
         tokens << [:CONSTANT, constant]
         i += constant.size
@@ -28,11 +28,11 @@ class Lexer
       elsif number = chunk[/\A([0-9]+)/, 1]
         tokens << [:NUMBER, number.to_i]
         i += number.size
-
+        
       elsif string = chunk[/\A"([^"]*)"/, 1]
         tokens << [:STRING, string]
         i += string.size + 2 
-
+      
       elsif indent = chunk[/\A\:\n( +)/m, 1] 
         if indent.size <= current_indent 
           raise "Bad indent level, got #{indent.size} indents, " +
@@ -53,11 +53,11 @@ class Lexer
             tokens << [:DEDENT, indent.size]
           end
           tokens << [:NEWLINE, "\n"]
-        else 
+        else
           raise "Missing ':'" 
         end
         i += indent.size + 1
-      
+
       elsif operator = chunk[/\A(\|\||&&|==|!=|<=|>=)/, 1]
         tokens << [operator, operator]
         i += operator.size

data/lib/turmali/nodes.rb

@@ -43,4 +43,6 @@ class DefNode < Struct.new(:name, :params, :body); end
 
 class ClassNode < Struct.new(:name, :body); end
 
-class IfNode  < Struct.new(:condition, :body); end
+class IfNode  < Struct.new(:condition, :body); end
+
+class WhileNode < Struct.new(:condition, :body); end

data/lib/turmali/parser.rb

@@ -1,13 +1,13 @@
 #
 # DO NOT MODIFY!!!!
-# This file is automatically generated by Racc 1.4.6
+# This file is automatically generated by Racc 1.4.14
 # from Racc grammer file "".
 #
 
 require 'racc/parser.rb'
 
-require "turmali/lexer"
-require "turmali/nodes"
+  require "turmali/lexer"
+  require "turmali/nodes"
 
 class Parser < Racc::Parser
 
@@ -27,23 +27,23 @@ module_eval(<<'...end grammar.y/module_eval...', 'grammar.y', 220)
 racc_action_table = [
     27,    25,    26,    16,    18,    19,    20,    21,    22,    23,
     24,    27,    25,    26,    16,    18,    19,    20,    21,    22,
-    23,    24,    30,    72,    41,    42,    39,    40,    53,    15,
-    30,    17,    41,    42,    39,    40,    30,    16,    16,    30,
-    15,    74,    17,    27,    25,    26,    84,    18,    19,    20,
-    21,    22,    23,    24,    27,    25,    26,    45,    18,    19,
-    20,    21,    22,    23,    24,    17,    17,    30,    72,    41,
-    42,    47,    15,    68,    30,    82,    41,    42,    39,    40,
+    23,    24,    30,    72,    41,    42,    39,    40,    88,    15,
+    30,    17,    41,    42,    39,    40,    30,    16,    41,    42,
+    15,    74,    17,    27,    25,    26,    51,    18,    19,    20,
+    21,    22,    23,    24,    27,    25,    26,    49,    18,    19,
+    20,    21,    22,    23,    24,    17,    16,    30,    48,    41,
+    42,    47,    15,    68,    30,    84,    41,    42,    39,    40,
     27,    25,    26,    15,    18,    19,    20,    21,    22,    23,
-    24,    27,    25,    26,    48,    18,    19,    20,    21,    22,
-    23,    24,    30,    28,    41,    42,    27,    25,    26,    15,
+    24,    27,    25,    26,    17,    18,    19,    20,    21,    22,
+    23,    24,    46,    79,    45,    78,    27,    25,    26,    15,
     18,    19,    20,    21,    22,    23,    24,    27,    25,    26,
-    15,    18,    19,    20,    21,    22,    23,    24,    86,    79,
-    85,    78,    27,    25,    26,    15,    18,    19,    20,    21,
+    15,    18,    19,    20,    21,    22,    23,    24,    86,    72,
+    85,    45,    27,    25,    26,    15,    18,    19,    20,    21,
     22,    23,    24,    27,    25,    26,    15,    18,    19,    20,
-    21,    22,    23,    24,    46,    49,    45,    51,    27,    25,
+    21,    22,    23,    24,    30,    30,    82,    28,    27,    25,
     26,    15,    18,    19,    20,    21,    22,    23,    24,    27,
     25,    26,    15,    18,    19,    20,    21,    22,    23,    24,
-    72,    88,   nil,   nil,    27,    25,    26,    15,    18,    19,
+    72,    53,   nil,   nil,    27,    25,    26,    15,    18,    19,
     20,    21,    22,    23,    24,    27,    25,    26,    15,    18,
     19,    20,    21,    22,    23,    24,   nil,   nil,   nil,   nil,
     27,    25,    26,    15,    18,    19,    20,    21,    22,    23,
@@ -76,62 +76,62 @@ racc_action_table = [
 racc_action_check = [
      0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
      0,    72,    72,    72,    72,    72,    72,    72,    72,    72,
-    72,    72,    61,    48,    61,    61,    61,    61,    30,     0,
-    60,     0,    60,    60,    60,    60,    64,    80,     2,    65,
-    72,    48,    72,    45,    45,    45,    80,    45,    45,    45,
-    45,    45,    45,    45,    29,    29,    29,    53,    29,    29,
-    29,    29,    29,    29,    29,    80,     2,    62,    49,    62,
-    62,    24,    45,    45,    58,    74,    58,    58,    58,    58,
-    15,    15,    15,    29,    15,    15,    15,    15,    15,    15,
-    15,    40,    40,    40,    25,    40,    40,    40,    40,    40,
-    40,    40,    63,     1,    63,    63,    41,    41,    41,    15,
-    41,    41,    41,    41,    41,    41,    41,    47,    47,    47,
-    40,    47,    47,    47,    47,    47,    47,    47,    81,    69,
-    81,    69,    46,    46,    46,    41,    46,    46,    46,    46,
-    46,    46,    46,    27,    27,    27,    47,    27,    27,    27,
-    27,    27,    27,    27,    23,    26,    23,    28,    39,    39,
-    39,    46,    39,    39,    39,    39,    39,    39,    39,    79,
-    79,    79,    27,    79,    79,    79,    79,    79,    79,    79,
-    85,    86,   nil,   nil,    42,    42,    42,    39,    42,    42,
-    42,    42,    42,    42,    42,    38,    38,    38,    79,    38,
-    38,    38,    38,    38,    38,    38,   nil,   nil,   nil,   nil,
+    72,    72,    58,    48,    58,    58,    58,    58,    86,     0,
+    59,     0,    59,    59,    59,    59,    63,     2,    63,    63,
+    72,    48,    72,    45,    45,    45,    28,    45,    45,    45,
+    45,    45,    45,    45,    40,    40,    40,    26,    40,    40,
+    40,    40,    40,    40,    40,     2,    80,    62,    25,    62,
+    62,    24,    45,    45,    60,    80,    60,    60,    60,    60,
+    79,    79,    79,    40,    79,    79,    79,    79,    79,    79,
+    79,    15,    15,    15,    80,    15,    15,    15,    15,    15,
+    15,    15,    23,    69,    23,    69,    39,    39,    39,    79,
+    39,    39,    39,    39,    39,    39,    39,    41,    41,    41,
+    15,    41,    41,    41,    41,    41,    41,    41,    81,    49,
+    81,    53,    47,    47,    47,    39,    47,    47,    47,    47,
+    47,    47,    47,    46,    46,    46,    41,    46,    46,    46,
+    46,    46,    46,    46,    64,    65,    74,     1,    27,    27,
+    27,    47,    27,    27,    27,    27,    27,    27,    27,    29,
+    29,    29,    46,    29,    29,    29,    29,    29,    29,    29,
+    85,    30,   nil,   nil,    42,    42,    42,    27,    42,    42,
+    42,    42,    42,    42,    42,    31,    31,    31,    29,    31,
+    31,    31,    31,    31,    31,    31,   nil,   nil,   nil,   nil,
     32,    32,    32,    42,    32,    32,    32,    32,    32,    32,
-    32,    33,    33,    33,    38,    33,    33,    33,    33,    33,
+    32,    33,    33,    33,    31,    33,    33,    33,    33,    33,
     33,    33,   nil,   nil,   nil,   nil,    34,    34,    34,    32,
     34,    34,    34,    34,    34,    34,    34,    35,    35,    35,
     33,    35,    35,    35,    35,    35,    35,    35,   nil,   nil,
    nil,   nil,    36,    36,    36,    34,    36,    36,    36,    36,
     36,    36,    36,    37,    37,    37,    35,    37,    37,    37,
-    37,    37,    37,    37,   nil,   nil,   nil,   nil,    31,    31,
-    31,    36,    31,    31,    31,    31,    31,    31,    31,   nil,
+    37,    37,    37,    37,   nil,   nil,   nil,   nil,    38,    38,
+    38,    36,    38,    38,    38,    38,    38,    38,    38,   nil,
    nil,    43,    37,    43,    43,    43,    43,    43,    43,    43,
-    43,    43,    43,    43,    43,   nil,   nil,    31,    43,    50,
+    43,    43,    43,    43,    43,   nil,   nil,    38,    43,    50,
    nil,    50,   nil,    50,    50,    50,    50,    50,    50,    50,
-    50,    50,    50,    50,    50,     3,   nil,     3,     3,     3,
-     3,     3,     3,     3,     3,     3,     3,     3,     3,    52,
-   nil,    52,    52,    52,    52,    52,    52,    52,    52,    52,
-    52,    52,    52,    83,   nil,    83,    83,    83,    83,    83,
-    83,    83,    83,    83,    83,    83,    83,    70,   nil,    70,
-    70,    70,    70,    70,    70,    70,    70,    70,    70,    70,
-    70,    71,   nil,    71,    71,    71,    71,    71,    71,    71,
-    71,    71,    71,    71,    71,    67,   nil,    67,    67,    67,
-    67,    67,    67,    67,    67,    67,    67,    67,    67,    54,
+    50,    50,    50,    50,    50,    70,   nil,    70,    70,    70,
+    70,    70,    70,    70,    70,    70,    70,    70,    70,    71,
+   nil,    71,    71,    71,    71,    71,    71,    71,    71,    71,
+    71,    71,    71,    83,   nil,    83,    83,    83,    83,    83,
+    83,    83,    83,    83,    83,    83,    83,    67,   nil,    67,
+    67,    67,    67,    67,    67,    67,    67,    67,    67,    67,
+    67,     3,   nil,     3,     3,     3,     3,     3,     3,     3,
+     3,     3,     3,     3,     3,    52,   nil,    52,    52,    52,
+    52,    52,    52,    52,    52,    52,    52,    52,    52,    54,
    nil,    54,    54,    54,    54,    54,    54,    54,    54,    54,
     54,    54,    55,   nil,    55,    55,    55,    55,    55,    55,
-    55,    55,    55,    55,    57,   nil,    57,    57,    57,    57,
-    57,    57,    57,    57,    56,   nil,    56,    56,    56,    56,
-    56,    56,    56,    56,    59,   nil,    59,    59,    59,    59 ]
+    55,    55,    55,    55,    56,   nil,    56,    56,    56,    56,
+    56,    56,    56,    56,    57,   nil,    57,    57,    57,    57,
+    57,    57,    57,    57,    61,   nil,    61,    61,    61,    61 ]
 
 racc_action_pointer = [
-    -2,   103,    33,   320,   nil,   nil,   nil,   nil,   nil,   nil,
-   nil,   nil,   nil,   nil,   nil,    78,   nil,   nil,   nil,   nil,
-   nil,   nil,   nil,   125,    42,    83,   143,   141,   157,    52,
-    17,   286,   208,   219,   234,   245,   260,   271,   193,   156,
-    89,   104,   182,   286,   nil,    41,   130,   115,    10,    55,
-   306,   nil,   334,    26,   404,   417,   439,   429,    59,   449,
-    15,     7,    52,    87,    21,    24,   nil,   390,   nil,    99,
-   362,   376,     9,   nil,    64,   nil,   nil,   nil,   nil,   167,
-    32,    98,   nil,   348,   nil,   167,   170,   nil,   nil ]
+    -2,   157,    32,   376,   nil,   nil,   nil,   nil,   nil,   nil,
+   nil,   nil,   nil,   nil,   nil,    89,   nil,   nil,   nil,   nil,
+   nil,   nil,   nil,    73,    42,    57,    45,   156,    46,   167,
+   170,   193,   208,   219,   234,   245,   260,   271,   286,   104,
+    52,   115,   182,   286,   nil,    41,   141,   130,    10,   116,
+   306,   nil,   390,   100,   404,   417,   429,   439,     7,    15,
+    59,   449,    52,    21,   139,   140,   nil,   362,   nil,    73,
+   320,   334,     9,   nil,   145,   nil,   nil,   nil,   nil,    78,
+    61,    98,   nil,   348,   nil,   167,    17,   nil,   nil ]
 
 racc_action_default = [
     -1,   -56,    -2,    -3,    -6,    -7,    -8,    -9,   -10,   -11,
@@ -145,7 +145,7 @@ racc_action_default = [
    -56,   -56,   -52,   -31,   -48,   -56,   -56,   -50,   -53 ]
 
 racc_goto_table = [
-    29,     2,    43,    73,    75,    76,    44,     1,    69,    81,
+    29,     2,    43,    73,    75,    76,    44,    81,    69,     1,
    nil,   nil,   nil,   nil,    50,   nil,    52,   nil,    54,    55,
     56,    57,    58,    59,    60,    61,    62,    63,    64,    65,
    nil,   nil,    67,    70,    71,   nil,    77,   nil,   nil,   nil,
@@ -155,7 +155,7 @@ racc_goto_table = [
    nil,   nil,   nil,    80,   nil,   nil,   nil,   nil,    29 ]
 
 racc_goto_check = [
-     4,     2,     3,    17,    17,    17,    15,     1,    16,    18,
+     4,     2,     3,    17,    17,    17,    15,    18,    16,     1,
    nil,   nil,   nil,   nil,     3,   nil,     3,   nil,     3,     3,
      3,     3,     3,     3,     3,     3,     3,     3,     3,     3,
    nil,   nil,     3,     3,     3,   nil,    15,   nil,   nil,   nil,
@@ -165,8 +165,8 @@ racc_goto_check = [
    nil,   nil,   nil,     2,   nil,   nil,   nil,   nil,     4 ]
 
 racc_goto_pointer = [
-   nil,     7,     1,   -13,    -2,   nil,   nil,   nil,   nil,   nil,
-   nil,   nil,   nil,   nil,   nil,   -17,   -37,   -45,   -65 ]
+   nil,     9,     1,   -13,    -2,   nil,   nil,   nil,   nil,   nil,
+   nil,   nil,   nil,   nil,   nil,   -17,   -37,   -45,   -67 ]
 
 racc_goto_default = [
    nil,   nil,   nil,     3,     4,     5,     6,     7,     8,     9,

data/lib/turmali/runtime/bootstrap.rb

@@ -27,3 +27,23 @@ Constants["Object"].def :print do |receiver, arguments|
   puts arguments.first.ruby_value
   Constants["nil"] 
 end
+
+Constants["Number"].def :+ do |receiver,arguments|
+	result = receiver.ruby_value + arguments.first.ruby_value 
+	Constants["Number"].new_with_value(result)
+end
+
+Constants["Number"].def :- do |receiver,arguments|
+	result = receiver.ruby_value - arguments.first.ruby_value 
+	Constants["Number"].new_with_value(result)
+end
+
+Constants["Number"].def :* do |receiver,arguments|
+	result = receiver.ruby_value * arguments.first.ruby_value 
+	Constants["Number"].new_with_value(result)
+end
+
+Constants["Number"].def :/ do |receiver,arguments|
+	result = receiver.ruby_value / arguments.first.ruby_value 
+	Constants["Number"].new_with_value(result)
+end

data/lib/turmali/runtime/object.rb

@@ -5,7 +5,7 @@ class TurmaliObject
     @runtime_class = runtime_class
     @ruby_value = ruby_value
   end
-
+  
   def call(method, arguments=[])
     @runtime_class.lookup(method).call(self, arguments)
   end

data/lib/turmali/version.rb

@@ -1,3 +1,3 @@
 module Turmali
-  VERSION = "0.0.3"
+  VERSION = "0.0.4"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: turmali
 version: !ruby/object:Gem::Version
-  version: 0.0.3
+  version: 0.0.4
 platform: ruby
 authors:
 - Eiffel Qiu
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-07-26 00:00:00.000000000 Z
+date: 2017-07-27 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler