alphalang 0.2.7 → 0.2.9

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 03e9f2d6c36766c890ac954b41a9bf02f2fe70e1f4ac4a3d40843ff03c228b28
-  data.tar.gz: bd5b500b199a1e32964a311847a28f39ca3b6059c2f06e0e8fcbd608106a641a
+  metadata.gz: fd90e0cc81ecac899602c5a173f188110fecd877428fcab72e8bc77076e75d00
+  data.tar.gz: 1b1e538edb038c95ccffcb50fb8f48f5081977701082164da879ab848af80edb
 SHA512:
-  metadata.gz: 9ad4f5de676ecdd7afc6d630c4a3934aba3d45623a8b45e19196574b7453641b077c5c5ac3a2d1c4edad06cacfaa17b28d7abf778fd894c7c4494c01a9d56654
-  data.tar.gz: 39f631c8dff1ecd6879786cee70656cb6c6b018db070d49d8c7e5cc6fccf8de018ba0ccf0608cdf11c00670f36d63eb2dcce5780c4cd2122b5b0a4cbc6e1ab9a
+  metadata.gz: 95e31bbc359dc485d7e5e623164f2f3c636c68975e6c7bd1c83fcfe75c11cbe8b1fe6c4d35eeefae0bfcf7c0b668f673a8649cea39d9bfe6f7319d860947e87b
+  data.tar.gz: 15cd10c8ce16fea278f3d99f3c8caecf3e811249c6a1d933360433d22ca06c0816602555a1aa314ba720a00229e6401256520de7d664da884a98e1bff2e3d24e

data/bin/alphalang

@@ -44,6 +44,10 @@ OptionParser.new do |opts|
   opts.on('--listlocale', 'Lists all keywords from a specific locale file from your locales directory.') do
     options[:listlocale] = true
   end
+
+  opts.on('--printtree', 'Lists all keywords from a specific locale file from your locales directory.') do
+    options[:printtree] = true
+  end
 end.parse!
 
 verbose_flag = options[:verbose]
@@ -54,6 +58,8 @@ create_locale_flag = options[:createlocale]
 delete_locale_flag = options[:deletelocale]
 list_locales_flag = options[:listlocales]
 list_locale_flag = options[:listlocale]
+PRINT_TREE_FLAG = options[:printtree]
+TREE_ARRAY = []
 
 if create_locale_flag
   require_relative '../lib/locale_creator'

data/lib/alpha.rb

@@ -36,31 +36,48 @@ class LangParser
         match(:stmt)
       end
 
+      ###################### Statement Rules
+
       rule :stmt do
         match(:if_comp_stmt)
+        match(:loop)
+        match(:declaration)
+        match(:builtin)
+        match(:expr_stmt)
+      end
+
+      rule :loop do
         match(:while_stmt)
+      end
+
+      rule :declaration do
         match(:func_dec)
         match(:ass_stmt)
+      end
+
+      rule :builtin do
         match(:pause_stmt)
-        match(:expr_stmt)
+        match(:print_stmt)
       end
 
+      ###################### If Statement Rules
+
       rule :if_comp_stmt do
         match(:if_stmt, :comp_elseif, :else_stmt, :STOP) { |a, b, c| IfCompStmtNode.new(a, b, c) }
         match(:if_stmt, :else_stmt, :STOP) { |a, b| IfCompStmtNode.new(a, b) }
         match(:if_stmt, :STOP) { |a| IfCompStmtNode.new(a) }
       end
 
-      rule :comp_elseif do
-        match(:elseif_stmt, :comp_elseif) { |a, b| [a, b] }
-        match(:elseif_stmt)
-      end
-
       rule :if_stmt do
         match(:IF, :expr_stmt, :and, :expr_stmt, :comp_stmt) { |_, a, b, c, d| IfCompactNode.new(a, b, c, d) }
         match(:IF, :expr_stmt, :comp_stmt) { |_, a, b| IfNode.new(a, b) }
       end
 
+      rule :comp_elseif do
+        match(:elseif_stmt, :comp_elseif) { |a, b| [a, b] }
+        match(:elseif_stmt)
+      end
+
       rule :elseif_stmt do
         match(:ELSEIF, :expr_stmt, :comp_stmt) { |_, a, b| ElseifNode.new(a, b) }
       end
@@ -69,12 +86,16 @@ class LangParser
         match(:ELSE, :comp_stmt) { |_, b| ElseNode.new(b) }
       end
 
+      ###################### Loop Rules
+
       rule :while_stmt do
         match(:WHILE, :expr_stmt, :comp_stmt, :STOP) { |_, a, b| WhileLoopNode.new(a, b) }
       end
 
+      ###################### Variable and Function Declare Rules
+
       rule :func_dec do
-        match(:DEF, :member, :comp_stmt, :STOP) { |_, name, value, _| FunctionDecNode.new(name, value) }
+        match(:DEF, :call_member, :comp_stmt, :STOP) { |_, name, value, _| FunctionDecNode.new(name, value) }
       end
 
       rule :ass_stmt do
@@ -82,10 +103,18 @@ class LangParser
         match(:member, '=', :array_stmt) { |var, _, value| VariableDecNode.new(var, value) }
       end
 
+      ###################### Built-In Function Rules
+
       rule :pause_stmt do
         match(:PAUSE, :expr) { |_, a| PauseNode.new(a) }
       end
 
+      rule :print_stmt do
+        match(:PRINT, :expr) { |_, a| PrintNode.new(a) }
+      end
+
+      ###################### Expression Rules
+
       rule :expr_stmt do
         match(:or_stmt)
         match(:and_stmt)
@@ -105,15 +134,6 @@ class LangParser
         match(:NOT, :expr_stmt) { |_, b| NotNode.new(b) }
       end
 
-      rule :array_stmt do
-        match('[', :arg_list, ']') { |_, array, _| array }
-      end
-
-      rule :arg_list do
-        match(:expr, ',', :arg_list) { |a, _, b| ArrayNode.new(a, b) }
-        match(:expr) { |a| ArrayNode.new(a, NilClass) }
-      end
-
       rule :expr do
         match(:expr, /(<|>)/, :expr) { |a, op, b| CompareNode.new(a, op, b) }
         match(/(<|>)/, :expr) { |op, b| CompareNode.new(nil, op, b) }
@@ -131,25 +151,46 @@ class LangParser
         match(:atom)
       end
 
+      ###################### Data Types Rules
+
+      rule :array_stmt do
+        match('[', :arg_list, ']') { |_, array, _| array }
+      end
+
+      rule :arg_list do
+        match(:expr, ',', :arg_list) { |a, _, b| ArrayNode.new(a, b) }
+        match(:expr) { |a| ArrayNode.new(a, NilClass) }
+      end
+
       rule :atom do
-        match('-', /\d+/, '.', /\d+/) { |neg, a, dot, b| NumberNode.new((neg+a+dot+b)) }
-        match(/\d+/, '.', /\d+/) { |a, dot, b| NumberNode.new((a+dot+b)) }
-        match('-', /\d+/) { |neg, a| NumberNode.new(neg + a) }
-        match(/\d+/) { |a| NumberNode.new(a) }
+        match(:number)
+        match(:boolean)
+        match(:call_member)
+        match(:prio_stmt)
+      end
+
+      rule :boolean do
         match(ScopeManager.true_value) { |a| BoolNode.new(a) }
         match(ScopeManager.false_value) { |a| BoolNode.new(a) }
-        match(:PRINT, :member) { |_, a| PrintNode.new(a) }
-        match(:PRINT, :expr) { |_, a| PrintNode.new(a) }
-        match(:member)
-        match(:prio_stmt)
+      end
+
+      rule :number do
+        match('-', /\d+/, '.', /\d+/) { |neg, a, dot, b| NumberNode.new(neg + a + dot + b) }
+        match(/\d+/, '.', /\d+/) { |a, dot, b| NumberNode.new(a + dot + b) }
+        match('-', /\d+/) { |neg, a| NumberNode.new(neg + a) }
+        match(/\d+/) { |a| NumberNode.new(a) }
+      end
+
+      rule :call_member do
+        match(:member, '(', :arg_list, ')') { |var, _, args, _| FuncCallNode.new(var, args) }
+        match(:member, '(', ')') { |var, _, _| FuncCallNode.new(var, NilClass) }
+        match(:member, '[', '-', /\d+/, ']') { |var, _, neg, index, _| ArrayCallNode.new(var, (neg+index)) }
+        match(:member, '[', /\d+/, ']') { |var, _, index, _| ArrayCallNode.new(var, index) }
+        match(:member) { |var| VariableCallNode.new(var) }
       end
 
       rule :member do
-        match(/[a-z]/, '(', :arg_list, ')') { |var, _, args, _| FuncCallNode.new(var, args) }
-        match(/[a-z]/, '(', ')') { |var, _, _| FuncCallNode.new(var, NilClass) }
-        match(/[a-z]/, '[', '-', /\d+/, ']') { |var, _, neg, index, _| ArrayCallNode.new(var, (neg+index)) }
-        match(/[a-z]/, '[', /\d+/, ']') { |var, _, index, _| ArrayCallNode.new(var, index) }
-        match(/[a-z]/) { |var| VariableCallNode.new(var) }
+        match(/[a-z]/)
       end
 
       rule :prio_stmt do
@@ -161,7 +202,9 @@ class LangParser
   def parse_file(filename)
     file = File.read(filename)
     root = @langParser.parse file
-    root.evaluate
+    root = root.evaluate
+    puts TREE_ARRAY
+    root
   end
 
   def calc_test(str)

data/lib/nodes/basenodes.rb

@@ -36,6 +36,10 @@ class BoolNode < Node
     @value = false if value == ScopeManager.false_value
   end
 
+  def to_s
+    @value.to_s
+  end
+
   def evaluate
     @value
   end
@@ -53,6 +57,10 @@ class AndNode < Node
     end
   end
 
+  def to_s
+    "#{@lhs} and #{@rhs}"
+  end
+
   def evaluate
     @lhs.evaluate && @rhs.evaluate
   end
@@ -68,6 +76,10 @@ class OrNode < Node
     end
   end
 
+  def to_s
+    "#{@lhs} or #{@rhs}"
+  end
+
   def evaluate
     @lhs.evaluate || @rhs.evaluate
   end
@@ -78,6 +90,10 @@ class NotNode < Node
     @node = node
   end
 
+  def to_s
+    "not #{@node}"
+  end
+
   def evaluate
     not @node.evaluate
   end
@@ -92,6 +108,10 @@ class CompareNode < Node
     @lhs, @op, @rhs = lhs, op, rhs
   end
 
+  def to_s
+    "#{@lhs} #{@op} #{@rhs}"
+  end
+
   def evaluate
     @value = @lhs.evaluate.send(@op, @rhs.evaluate)
   end
@@ -105,21 +125,13 @@ class BinaryOperationNode < Node
     @lhs, @op, @rhs = lhs, op, rhs
   end
 
+  def to_s
+    "#{@lhs} #{@op} #{@rhs}"
+  end
+
   def evaluate
     if @rhs.evaluate.is_a?(ArrayNode) && @op == '+'
       return @value = @rhs.evaluate + @lhs.evaluate
-    elsif @lhs.evaluate.is_a?(Array) && @op == '+'
-      return @value = @lhs.evaluate.append(@rhs.evaluate)
-    end
-
-    if @rhs.evaluate.is_a?(ArrayNode) && @op == '-'
-      return @value = @rhs.evaluate - @lhs.evaluate
-    elsif @lhs.evaluate.is_a?(Array) && @op == '-'
-      return @lhs.evaluate.reject { |v| v.evaluate == @rhs.evaluate }
-    end
-
-    if @rhs.evaluate.is_a?(ArrayNode) or @rhs.evaluate.is_a?(Array) and @lhs.evaluate.is_a?(Numeric)
-      raise SyntaxError, "You can't subtract an array from a number! #{@lhs.evaluate} #{@op} #{@rhs.name}"
     end
 
     if @op == '/'
@@ -163,10 +175,12 @@ class ArrayNode < Node
 
   def +(value)
     @value.append(value)
+    self
   end
 
   def -(value)
-    @value.reject { |v| v.evaluate == value }
+    @value = @value.reject { |v| v.evaluate == value }
+    self
   end
 
   def [](index)

data/lib/nodes/stmtnodes.rb

@@ -1,5 +1,11 @@
 require_relative 'basenodes'
 
+def set_up_scope_header
+  result = "<#{ScopeManager.scope_lvl}>   "
+  result += '++--++--' * (ScopeManager.scope_lvl + 1) + ' '
+  result
+end
+
 ###################### Variable Nodes
 
 class VariableCallNode < Node
@@ -9,8 +15,19 @@ class VariableCallNode < Node
     @name = name
   end
 
+  def create_tree_entry
+    result = set_up_scope_header
+    result += "Variable #{@name} is now  #{@value}"
+    TREE_ARRAY << result unless TREE_ARRAY[-1] == result
+  end
+
+  def to_s
+    @name
+  end
+
   def evaluate
     @value = ScopeManager.lookup_var(@name)
+    create_tree_entry if PRINT_TREE_FLAG
     return @value
   end
 end
@@ -23,8 +40,19 @@ class VariableDecNode < Node
     @name = name
   end
 
+  def create_tree_entry
+    result = set_up_scope_header
+    result += "Variable #{@name} is now  #{@value}"
+    TREE_ARRAY << result unless TREE_ARRAY[-1] == result
+  end
+
+  def to_s
+    "#{@name} = #{@value}"
+  end
+
   def evaluate
     ScopeManager.add_to_current_scope(name, @value)
+    create_tree_entry if PRINT_TREE_FLAG
     self
   end
 end
@@ -41,6 +69,7 @@ class ArrayCallNode < Node
       raise ArgumentError, "You are trying to access an out of bounds index. Here -> #{@value}[#{@index}]"
     end
     @value = arr[@index]
+    @value
   end
 end
 
@@ -53,8 +82,19 @@ class FunctionDecNode < Node
     @args = node.args
   end
 
+  def create_tree_entry
+    result = set_up_scope_header
+    result += "Function #{@name} declared"
+    TREE_ARRAY << result unless TREE_ARRAY[-1] == result
+  end
+
+  def to_s
+    "#{@name} = #{@value}"
+  end
+
   def evaluate
     ScopeManager.add_func_to_global_scope(@name, @value, @args)
+    create_tree_entry if PRINT_TREE_FLAG
     return nil
   end
 end
@@ -67,6 +107,20 @@ class FuncCallNode < Node
     @args = args
   end
 
+  def to_s
+    if @args == NilClass
+      "#{name}()"
+    else
+      "#{name}(#{@args})"
+    end
+  end
+
+  def create_tree_entry
+    result = set_up_scope_header
+    result += "Function #{@name} is called"
+    TREE_ARRAY << result unless TREE_ARRAY[-1] == result
+  end
+
   def evaluate
     func = ScopeManager.lookup_func(@name)
 
@@ -95,6 +149,7 @@ class FuncCallNode < Node
       ScopeManager.scope_lvl = old_scope_lvl
     end
 
+    create_tree_entry if PRINT_TREE_FLAG
     return func_return_value
   end
 end
@@ -108,8 +163,20 @@ class IfNode < Node
     @argument, @node = argument, node
   end
 
+  def to_s
+    "If #{argument}"
+  end
+
+  def create_tree_entry
+    result = set_up_scope_header
+    result += "If statement #{@argument} is used"
+    TREE_ARRAY << result unless TREE_ARRAY[-1] == result
+  end
+
   def evaluate
     @value = @node.evaluate
+    create_tree_entry if PRINT_TREE_FLAG
+    @value
   end
 end
 
@@ -120,8 +187,20 @@ class ElseifNode < Node
     @argument, @node = argument, node
   end
 
+  def to_s
+    'Else'
+  end
+
+  def create_tree_entry
+    result = set_up_scope_header
+    result += "Elseif statement is used. #{@argument}"
+    TREE_ARRAY << result unless TREE_ARRAY[-1] == result
+  end
+
   def evaluate
     @value = @node.evaluate
+    create_tree_entry if PRINT_TREE_FLAG
+    @value
   end
 end
 
@@ -133,8 +212,16 @@ class ElseNode < Node
     @argument = BoolNode.new(ScopeManager.true_value)
   end
 
+  def create_tree_entry
+    result = set_up_scope_header
+    result += "Else statement is used."
+    TREE_ARRAY << result unless TREE_ARRAY[-1] == result
+  end
+
   def evaluate
     @value = @node.evaluate
+    create_tree_entry if PRINT_TREE_FLAG
+    @value
   end
 end
 
@@ -163,10 +250,19 @@ class WhileLoopNode < Node
     super(statement)
   end
 
+  def create_tree_entry
+    result = set_up_scope_header
+    result += "While Loop ran with #{@counter} iterations."
+    TREE_ARRAY << result unless TREE_ARRAY[-1] == result
+  end
+
   def evaluate
+    @counter = 0
     while @condition.evaluate
       @value.evaluate
+      @counter += 1
     end
+    create_tree_entry if PRINT_TREE_FLAG
     self.class
   end
 end
@@ -180,23 +276,20 @@ class PrintNode
     @value = value
   end
 
+  def create_tree_entry
+    result = set_up_scope_header
+    result += "Printed #{@value}."
+    TREE_ARRAY << result unless TREE_ARRAY[-1] == result
+  end
+
   def evaluate
     if @value.evaluate.is_a?(ArrayNode)
       print "Array #{@value.name}: "     unless TEST_UNIT_ACTIVE
       puts @value.evaluate               unless TEST_UNIT_ACTIVE
-    elsif @value.evaluate.is_a?(Array)
-      print "Array #{@value.name}: "     unless TEST_UNIT_ACTIVE
-      puts @value.evaluate.join(', ')    unless TEST_UNIT_ACTIVE
     else
-      if @value.evaluate == PrintNode
-        if @value.value.is_a?(VariableCallNode)
-          raise SyntaxError, "You have a duplicate 'print' statement! Printing #{@value.value.name} twice."
-        else
-          raise SyntaxError, "You have a duplicate 'print' statement! Printing #{@value.value} twice."
-        end
-      end
-      puts @value.evaluate              unless TEST_UNIT_ACTIVE
+      puts @value.evaluate               unless TEST_UNIT_ACTIVE
     end
+    create_tree_entry if PRINT_TREE_FLAG
     self.class
   end
 end
@@ -206,8 +299,15 @@ class PauseNode < Node
     super(value)
   end
 
+  def create_tree_entry
+    result = set_up_scope_header
+    result += "Paused for #{@value} seconds."
+    TREE_ARRAY << result unless TREE_ARRAY[-1] == result
+  end
+
   def evaluate
     @value = 0 if @value.evaluate.negative?
+    create_tree_entry if PRINT_TREE_FLAG
     sleep @value.evaluate
   end
 end

data/lib/rdparse.rb

@@ -187,81 +187,56 @@ class Parser
     end # until
   end
 
-  def find_faulty_expression_within_block(block_start_line, block_end_line, problematic_token)
-    if block_start_line == nil || block_end_line == nil
-      raise ParseError, "Error with <#{problematic_token}> somewhere around line #{block_end_line}#{block_start_line}"
-    end
-    index = 0
-    result = []
-    @file_string.each_line do |line|
-      if index > block_start_line and index < block_end_line
-
-        if line.match?(/;;.*$/)
-          line = line.split(';;')[0]
-        end
+  def convert_regex_sensitive_token(token)
+      token = @token_list['end'] if token == :STOP    # fulhack pga :END påstods inte funka för länge sen
+      token = '[(]' if token == '('
+      token = '[)]' if token == ')'
+      token = '[+]' if token == '+'
+      token = '[-]' if token == '-'
+      token = '[*]' if token == '*'
+      token = '[/]' if token == '/'
+      token = "#{@token_list['(not|!)'].split('|')[0][1..]}" if token == :NOT
+      token = "#{@token_list['(and|&&)'].split('|')[0][1..]}" if token == :AND
+      token = "#{@token_list['(or|\|\|)'].split('|')[0][1..]}" if token == :OR
+      token
+  end
 
-        if line.match?(/#{problematic_token}\s+$/)
-          result << "ParseError, #{line.strip}() is missing an expression on line #{index + 1}"
-        end
-      end
-      index += 1
+  def translate_tokens_array(array)
+    result = []
+    array.each do |token|
+      token = convert_regex_sensitive_token(token)
+      result << token unless token.is_a?(Symbol)
+      result << @token_list[token.to_s.downcase] if token.is_a?(Symbol)
     end
-    raise ParseError, result[-1]
+    result
   end
 
-  def find_faulty_expression_within_ends
-    puts 'TODO: Implement search for faulty token between two of the same guides'
-    raise ParseError, "Most likely mismatched '#{@token_list['END'.downcase]}' token."
+  def find_surrounding_code(problem_pos)
+    tokens_before_problem = []
+    temp = problem_pos
+    while temp >= 0
+      tokens_before_problem << @tokens[temp]
+      temp -= 1
+    end
+    tokens_before_problem.reverse
   end
 
   def find_faulty_line
-    if @tokens[@max_pos-0].is_a?(NilClass)
-      if @max_pos >= 3
-        puts "Problem is in the end of the file after:\n #{@tokens[@max_pos - 3]}#{@tokens[@max_pos - 2]}#{@tokens[@max_pos - 1]}"
-      else
-        puts "Problem is right in the beginning of the file."
-      end
-      raise ParseError
-    end
-
-    problematic_token = "#{@tokens[@max_pos - 1].downcase}"
-    before_problem = "#{@tokens[@max_pos - 2].downcase}"
-    after_problem = "#{@tokens[@max_pos - 0].downcase}"
-
-    after_problem = "[" + after_problem + "]" if !after_problem.match?(/[a-z]/)
-    before_problem = "[" + before_problem + "]" if !before_problem.match?(/[a-z]/)
+    tokens_before_problem = find_surrounding_code(@max_pos - 1)
+    file_as_array_without_whitespaces = translate_tokens_array(tokens_before_problem)
 
-    translated_problematic_token = @token_list[problematic_token]
+    pattern = file_as_array_without_whitespaces.join('\s*')
+    regex = Regexp.new(pattern)
 
-    if translated_problematic_token.is_a?(NilClass)
-      puts "The problem is #{before_problem}#{problematic_token}#{after_problem}"
-      raise ParseError, "Faulty expression, this is not completely implemented."
-    end
+    cleaned_string = @file_string.gsub(/;;.*/, '')
 
-    index = 0
-    problem_match_hash = {}
-    found_end = false
-    @file_string.each_line do |line|
+    match_data = regex.match(cleaned_string)
+    num_lines = match_data[0].count("\n") + 1
 
-      if line.match?(before_problem) && found_end == false
-        problem_match_hash[before_problem] = index
-      end
+    problem = @tokens[@max_pos]
+    problem = @token_list[problem.to_s.downcase] unless @token_list[problem.to_s.downcase].is_a?(NilClass)
 
-      if line.match?(after_problem) && index > problem_match_hash[before_problem]
-        problem_match_hash[after_problem] = index
-        found_end = true
-      end
-      index += 1
-    end
-
-    non_empty_line_before_problem = problem_match_hash[before_problem]
-    non_empty_line_after_problem = problem_match_hash[after_problem]
-
-    unless after_problem == before_problem
-      find_faulty_expression_within_block(non_empty_line_before_problem, non_empty_line_after_problem, problematic_token)
-    else
-      find_faulty_expression_within_ends
-    end
+    raise ParseError, "There is a problem around line #{num_lines}. Found <#{problem}>"
   end
 
   def parse(string)

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: alphalang
 version: !ruby/object:Gem::Version
-  version: 0.2.7
+  version: 0.2.9
 platform: ruby
 authors:
 - mattias, victor
@@ -74,8 +74,6 @@ files:
 - lib/nodes/scopemanager.rb
 - lib/nodes/stmtnodes.rb
 - lib/rdparse.rb
-- lib/tester/assign.alpha
-- lib/tester/assign.alpha~
 - lib/tester/demo_de.alpha
 - lib/tester/demo_emoji.alpha
 - lib/tester/demo_emoji.alpha~

data/lib/tester/assign.alpha

@@ -1,14 +0,0 @@
-x = 1
-
-def foo(bar)
-  y = 0
-  while bar < 20
-    print bar
-    bar = bar + 1
-    y = bar
-  end
-  print y
-  y
-end
-
-foo(x)

data/lib/tester/assign.alpha~

@@ -1,5 +0,0 @@
-x = 1
-
-def foo(bar)
-  y = bar
-end