Change operations priority, fix args analyzing

Author: ARtoriouSs

src/analyzer/analyzer.py

@@ -60,12 +60,12 @@ def _check_return_stat(self, statement):
         self._value_analyzer().validate(statement.value)
 
     def _check_fun_call(self, statement):
-        if statement.fun.undef:
-            self._error().signature_not_found(statement.name, statement.args)
-
         for arg in statement.args:
             self._value_analyzer().validate(arg)
 
+        if statement.fun.undef:
+            self._error().signature_not_found(statement.name, statement.args)
+
     def _check_if_stat(self, statement):
         self._value_analyzer().validate(statement.condition)
         self.validate(statement.then)

src/parser/grammar/SanyaScript.g4

@@ -56,11 +56,11 @@ value: cast value
      | '(' value ')'                                                            # parenthesizedValue
      | target=value '[' index=value ']'                                         # indexValue
      | 'not' value                                                              # notValue
+     | left=value operation=('/' | '*') right=value                             # divMultValue
+     | left=value operation=('+' | '-') right=value                             # sumSubtrValue
      | left=value operation='and' right=value                                   # andValue
      | left=value operation='or' right=value                                    # orValue
      | left=value operation=('==' | '!=' | '>=' | '<=' | '>' | '<') right=value # comparisonValue
-     | left=value operation=('/' | '*') right=value                             # divMultValue
-     | left=value operation=('+' | '-') right=value                             # sumSubtrValue
      | '^' value                                                                # nodeValue
      | source=value arc target=value                                            # arcValue
      | '[' graphPart? ']'                                                       # graphValue

test.sanya

@@ -1,21 +1,23 @@
-graph g = [
-  ^1 -> ^2,
-  ^2 -> ^3,
-  ^1 -> ^5,
-  ^3 -> ^6,
-  ^0 -> ^-3
-]
-
-node biggest_node(graph g) go
-  node maxx = ^-9999
-
-  for node n in nodes(g) go
-    if n > maxx go
-      maxx = n
+arc max_arc(graph g) go
+  num max_weight = -999999
+  arc max_arc
+  for arc a in arcs(g) go
+    if (num) source(a) + (num) target(a) > max_weight go
+      max_arc = a
+      max_weight = (num) source(a) + (num) target(a)
     end
   end
 
-  return maxx
+  return max_arc
 end
 
-puts(biggest_node(a))
+graph g = [
+  ^1 -> ^2,
+  ^2 -> ^4,
+  ^3 -> ^6,
+  ^3 -> ^4,
+  ^1 -> ^3,
+  ^7 -> ^1
+]
+
+puts(max_arc(g))