add static symbol check & test file update

test/ai.nas

@@ -81,13 +81,12 @@ var matrix=
         var prt_s='[\n';
         foreach(var i;mat.mat)
         {
-            var s='[';
+            prt_s~='[';
             foreach(var j;i)
-                s~=(j~',');
-            s~='],\n';
-            prt_s~=s;
+                prt_s~=(j~',');
+            prt_s~='],\n';
         }
-        prt_s~=']';
+        prt_s~=']\n';
         print(prt_s);
         return nil;
     },
@@ -295,9 +294,9 @@ var bp=
         var hidden_diff=matrix.mult_mat();
         matrix.prt_mat(hidden_diff);
 
-        output_layer=matrix.add_mat(output_layer,output_diff);
+        me.output_layer=matrix.add_mat(me.output_layer,output_diff);
         var error=0;
-        foreach(var i;tmp.mat[0])
+        foreach(var i;me.result.mat[0])
             error+=i;
         error*=0.5;
         return error;

test/call_ide.nas

@@ -1,30 +0,0 @@
-id[0] and id[1];
-1 or 2;
-"str" ==1;
-1*1/1+1;
-2*3*4/1-2+3;
-1-1+20-2*10;
-1+s1*(s2+s3[0])-1;
-var e=1+s1*(s2+s3[0])-1;
-id;
-"str";
-id(id);
-id("str",1,1);
-var e=1;
-var x=10*2-20;
-var id;
-var id=[1,2,3,4];
-var id={id:"str"};
-id();
-id.id();
-id.id.id();
-id[0].id.id(id,"str",1,2,3,4).id[10];
-id(0)[1].id;
-var hash={
-   h:"hello",
-   parent:[id],
-};
-function_test([1,2,3,4,55],1,2,3,{str:"str"});
-var (i,j,k,l,m,n) =[1,2,3,4,5,6];
-(var i,j,k)=[1,2,3];
-e=e[1:][0];

test/choice.nas

@@ -1,4 +1,4 @@
-
+import("lib.nas");
 var condition_true=1;
 var condition_false=0;
 if(condition_true)

test/json.nas

@@ -1,4 +1,5 @@
 #lib json.nas
+import("lib.nas");
 var json={
     text:'',
     line:1,

test/leetcode1319.nas

@@ -29,4 +29,4 @@ var makeConnect=func(n,connections)
     return cnt;
 }
 
-print(makeConnect(n,input));
+println(makeConnect(n,input));

test/nasal_test.nas

@@ -1,10 +1,10 @@
-#//This is written for Nasal Intepreter
-#//Sidi Liang
-
+# This is written for Nasal Intepreter
+# Sidi Liang
+import("lib.nas");
 var w = 1;
 var x = "hello";
 var f = func(){
-    print("f is called");
+    println("f is called");
 }
 var f2 = func(){
     return 2;
@@ -28,71 +28,27 @@ var z1 = {
     hashh:z
 };
 var y2 = [w, x, y, z1];
-
 var z2 = {
     hashh: z1,
     listt2: y2,
 };
 
-print(w);#//1
-print("\n");
-print(x);#//hello
-print("\n");
-print(y);#//Empty
-print("\n");
-print(z);#//Empty
-print("\n");
-print(z1);#//Empty
-print("\n");
-print(y2);#//Empty
-print("\n");
-print(y[0]);#//1
-print("\n");
-print(y1[2][1]);#//hello
-print("\n");
-print(z.numb);#//1
-print("\n");
-print(z.listt[2][1]);#//hello
-print("\n");
-print(z1.hashh.listt[2][1]);#//hello
-print("\n");
-print(y2[3].hashh.listt[2][1]);#//hello
-print("\n");
-print(f);#//Empty
-print("\n");
+println(w);#//1
+println(x);#//hello
+println(y);#//[1,hello]
+println(z);#//{...}
+println(z1);#//{...}
+println(y2);#//[...]
+println(y[0]);#//1
+println(y1[2][1]);#//hello
+println(z.numb);#//1
+println(z.listt[2][1]);#//hello
+println(z1.hashh.listt[2][1]);#//hello
+println(y2[3].hashh.listt[2][1]);#//hello
+println(f);#//func(...){...}
 f();#//f is called
-print("\n");
-print(z.funcc);#//Empty
-print("\n");
+println(z.funcc);#//func(...){...}
 z.funcc();#//f is called
-print("\n");
-print(z.funcccall);#//Empty
-print("\n");
-z.funcccall();#//f is called
-print("\n");
+println(z.funcccall);#//nil
 z2.listt2[3].hashh.funcc();#//f is called
-print("\n");
-print(y1[f2()][w]);#//hello
-print("\n");
-#//print(z.f3()); Error
-call(f);#//f is called
-print("\n");
-call(z.funcc);#//f is called
-print("\n");
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+println(y1[f2()][w]);#//hello

test/neo4j.nas

@@ -1,12 +1,12 @@
 import("lib.nas");
 
 rand(time(0));
-var chartable=split('','abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789');
+var chartable='abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789';
 var node=func(type)
 {
     var s="";
     for(var i=0;i<10;i+=1)
-        s~=chartable[rand()*62];
+        s~=chr(chartable[rand()*62]);
     return {name:s,type:type,next:[]};
 }
 var film_node=[];

test/quick_sort.nas

@@ -26,7 +26,7 @@ var sort=func(vec,left,right)
     return nil;
 }
 var vec=[];
-for(var i=0;i<500;i+=1)
+for(var i=0;i<200;i+=1)
     append(vec,int(rand()*1000));
 sort(vec,0,size(vec)-1);
 println(vec);

test/scalar.nas

@@ -115,7 +115,7 @@ var multi_assign_2=[10,9,8,7];
 ((-1*2+9))/7-1;
 ((({num:2})))["num"]*2*2*2;
 ((((([0,1,2])[0:2]))[0:2]))[1]-1;
-(((((((((((((((((((1+1+2+3+5)+8))+13)))+21))))+34)))))+55))))*89;
+println((((((((((((((((((((1+1+2+3+5)+8))+13)))+21))))+34)))))+55))))*89); # 12727
 number_1*(number_2+number_3)/90-number_4;
 (func test_func)()-1;
 hash_3.member_3+(func {return {what:"i don't tell you.",case_small:80,case_large:100}})()["case_large"]/10;
@@ -129,7 +129,7 @@ nil and 1+7*8;
 var hash={str:'hello',f:func{return me.str;}};
 var tmp_f=hash.f;
 hash=1;
-print(tmp_f());
+println(tmp_f());
 # undefined symbol 'me'
 # this means that 
 # when generating local_scope for function f,
@@ -138,13 +138,13 @@ print(tmp_f());
 var h1={str:'hello',f:func{return me.str;}};
 var h2={str:'world',f:func{return nil;}};
 h2.f=h1.f;
-print(h2.f());
+println(h2.f());
 # print 'world'
 # this means that 'me' in hash's functions
 # only points to the hash this function belongs to
 
-var f1=func(){print(1);return 1;}
-var f2=func(){print(2);return 0;}
+var f1=func(){println(1);return 1;}
+var f2=func(){println(2);return 0;}
 f1() or f2();
 # print '1'
 # this means that when using 'or' or 'and',

test/special.nas

@@ -1,24 +0,0 @@
-var hash={str:'hello',f:func{return me.str;}};
-var tmp_f=hash.f;
-hash=1;
-print(tmp_f());
-# undefined symbol 'me'
-# this means that 
-# when generating local_scope for function f,
-# nasal_gc will not count 'me' as one reference of this hash
-
-var h1={str:'hello',f:func{return me.str;}};
-var h2={str:'world',f:func{return nil;}};
-h2.f=h1.f;
-print(h2.f());
-# print 'world'
-# this means that 'me' in hash's functions
-# only points to the hash this function belongs to
-
-var f1=func(){print(1);return 1;}
-var f2=func(){print(2);return 0;}
-f1() or f2();
-# print '1'
-# this means that when using 'or' or 'and',
-# if the result is clear when calculating,
-# objects behind will not be calculated