complete grammar [test]

Author: mdodovic

MJCompiler/test/program.mj

@@ -1,70 +1,37 @@
-//Test 302
-
-program test302
-
-const int jedan = 1;
-
-int i;
-bool ibool;
-
-int niz2;
-
-record Test {
- int niz[];
- int a;
-}
+program Program
+	class A{int x[],y[];}
+	const int pi = 3, e = 2;
+	
+	class B extends A {
+		int i;
+		{
+			int getValue(int a) int b; bool c;{ return this.i + this.x[0] + a; }
+			void m(){}
+		}
+	}
 
-Test t1, t2;
+	class C extends B{A theA;int a;}
 
 {
-	
-	int sum(int z, int d)
-	{
-		return z + d;
-	}
-	
-	int inkrement(int a, int inc) 
-		int pom; 
-	{
-		if(inc == jedan) pom = 1;
-		else if(inc == 2) pom = a;
+	void main() A a; C c; int i; int x[]; char ch; {
+		a = new A;
+		a.x = new int[5]; a.y = new int[5];
 
-		return sum(a,pom);
-	}
-	
-	bool verify() {
-		print('v');
-		return false;
-	}	
-	
-	void main() int x;
-	{	
+		c = new C;
+		c.theA = a; c.x = new int[5];
 
-		if(1!=1) print(-6);
-		else print(0);  
-			
-		ibool = false;
+		x = new int[3];
+		read(c.i);
 		i = 0;
 		do{
-			if(i == 2) ibool = true;
+
+			read(c.x[i]); read(c.theA.x[i]);
 			i++;
-		}while(i < 5);
-		
-		if(ibool)
-			if(i == 5) print(1);
-			else print(-1); 
-		t1 = new Test;	
-		t1.a = 2;	
-		t1.niz = new int[3];
-		t1.niz[0] = 1 * t1.a;
-		t1.niz[1] = 2 * t1.a;
-		t1.niz[2] = sum(t1.niz[1], t1.niz[0]) * t1.a + 1;
-		if(verify() || t1.niz[2] == 4) print(ord('A')); 
-		else print(ord('a'));
+
+		}while(i<5);
 
-		print(eol);
-		i = 0;
+		print(c.getValue(c.theA.x[0]));
 
+		c.m();
 	}
-}
-
+}