#TDP - 22 End solution translate C#

add string block_function instead file record data
in file record  the end function ( КП->})
add method replace malloc
add private string:
name array in function (only 1 array!)
name function return array (only 1array!)
It's for add [] instead '*' in C in var array
Example -> int * a = b; -> int[] a = b;
int name(arg)-> static int[] name(arg)
int* n = (int*)mallloc(..)->int[] n = new int[]

Author: StrongerProgrammer7

CodeCSharp.txt

@@ -6,7 +6,7 @@ using System;
 	{
 			//#include "stdio.h" 
 		//#include <malloc.h> 
-	public int sizeNumber(int num)
+		static int sizeNumber(int num)
 		{
 			int count = 0;
 			while(num != 0)
@@ -17,10 +17,10 @@ using System;
 			return count;
 		}
 /*test comment*/ 
-	public int setDigitNumber(int num)
+		static int[] setDigitNumber(int num)
 		{
 			int size = sizeNumber(num);
-			int* digits = (int*)malloc(size * sizeof(int));
+			int[] digits = new int[size];
 			int index = 0;
 			while(num != 0)
 			{
@@ -37,19 +37,18 @@ comment
 		static void Main(string[] args)
 		{
 			int size = sizeNumber(36);
-			int* digitsNumber = setDigitNumber(36);
+			int[] digitsNumber = setDigitNumber(36);
 			int sum7Digit7 = 0;
 			for(int i = 0 ;i < size ;i++)
 			{
 			if(i < 100 && i > 0)
 			{
-				printf("array[%d] = %d \n",i,digitsNumber[i]) ;
+				Console.WriteLine("array[%d] = %d \n",i,digitsNumber[i]) ;
 			}
 				sum7Digit7 += digitsNumber[i] ;
 			}
-			printf("Summa digit: %d",sum7Digit7);
-			free(digitsNumber);
-			return 0;
+			Console.WriteLine("Summa digit: %d",sum7Digit7);
+
 		}
 	}
 }

RPN.txt

@@ -1,52 +1,52 @@
-W8 I10 
-W8 I11 
+W8 I0 
+W8 I1 
 
-I3 1 int I12 1 int 
+I2 1 int I3 1 int 
 1 1 �� 
-I13 1 int N1 O5 
-I12 N1 O10 
+I4 1 int N0 O5 
+I3 N0 O10 
 ��1 ��� 
-I12 I12 N3 O4 O5 
-I13 O20 
+I3 I3 N1 O4 O5 
+I4 O20 
 ��1:
-I13 W11 
+I4 W11 
 ��
 
 /*test comment*/ 
-I5 1 int I12 1 int 
+I5 1 int I3 1 int 
 2 1 �� 
-I2 1 int I3 I12 2� O5 
-I14 1 int* W9 I2 W10 1 int 2� O3 2� 1 int* O5 
-I15 1 int N1 O5 
-I12 N1 O10 
+I6 1 int I2 I3 2� O5 
+I7 1 int* W9 I6 W10 1 int 2� O3 2� 1 int* O5 
+I8 1 int N0 O5 
+I3 N0 O10 
 ��1 ��� 
-I14 I15 2��� I12 N3 O6 O5 
-I12 N3 O13 
-I15 O20 
+I7 I8 2��� I3 N1 O6 O5 
+I3 N1 O13 
+I8 O20 
 ��1:
-I14 W11 
+I7 W11 
 ��
 
 // Main 
 /* double
 comment 
 */ 
-W4 1 int I0 1 int I1 1��� 1 const char* 
+W4 1 int I9 1 int I10 1��� 1 const char* 
 3 1 �� 
-I2 1 int I3 N0 2� O5 
-I4 1 int* I5 N0 2� O5 
-I6 1 int N1 O5 
-I7 1 int N1 O5 I7 I2 O8 I7 O20 
+I6 1 int I2 N2 2� O5 
+I11 1 int* I5 N2 2� O5 
+I12 1 int N0 O5 
+I13 1 int N0 O5 I13 I6 O8 I13 O20 
 ���1 ��� 
-I7 N2 O8 I7 N1 O7 O17 
+I13 N3 O8 I13 N0 O7 O17 
 �1 ���
-I8 C0 I7 I4 I7 2��� 4� 
+I14 C0 I13 I11 I13 2��� 4� 
 �1: 
-I6 I4 I7 2��� O14 
+I12 I11 I13 2��� O14 
 ���1:
-I8 C1 I6 3� 
-I9 I4 2� 
-N1 W11 
+I14 C1 I12 3� 
+W20 I11 2� 
+N0 W11 
 ��
 
 

ReversePolishNotation.cpp

@@ -63,7 +63,7 @@ bool ReversePolishNotation::isExistsComma(std::string line)
 }
 bool ReversePolishNotation::isBeginFunctionName(std::string word)
 {
-	return word[0] == 'I' || word == "W9" || word == "W10" ? true : false;
+	return word[0] == 'I' || word == "W9" || word == "W10" || word == "W20" ? true : false;
 }
 
 bool ReversePolishNotation::isExistsFunctionExpression(std::vector<std::map<std::string, int>>& stack)

Translator.h

@@ -14,7 +14,7 @@ class Translator
 	virtual std::map<std::string, std::string> getSymbols();
 	virtual void initialize(std::map<std::string, std::string> identifier, std::map<std::string, std::string> numberConst, std::map<std::string, std::string> symbolsConst);
 protected:
-#define SIZE_serviceWord 19
+#define SIZE_serviceWord 20
 #define SIZE_separators 9
 #define SIZE_operation 20
 #define SIZE_columns 2
@@ -38,7 +38,8 @@ class Translator
 		{"float*","W16"},
 		{"double*","W17"},
 		{"char*","W18"},
-		{"const","W19"}
+		{"const","W19"},
+		{"free","W20"}
 	};
 	std::string const separators[SIZE_separators][SIZE_columns] =
 	{

lexical.txt

@@ -1,46 +1,46 @@
-W8 I10 
-W8 I11 
+W8 I0 
+W8 I1 
 
-W1 I3 R3 W1 I12 R4 
+W1 I2 R3 W1 I3 R4 
 R5 
-W1 I13 O5 N1 R7 
-W7 R3 I12 O10 N1 R4 
+W1 I4 O5 N0 R7 
+W7 R3 I3 O10 N0 R4 
 R5 
-I12 O5 I12 O4 N3 R7 
-I13 O20 R7 
+I3 O5 I3 O4 N1 R7 
+I4 O20 R7 
 R6 
-W11 I13 R7 
+W11 I4 R7 
 R6 
 /*test comment*/ 
-W1 I5 R3 W1 I12 R4 
+W1 I5 R3 W1 I3 R4 
 R5 
-W1 I2 O5 I3 R3 I12 R4 R7 
-W15 I14 O5 R3 W15 R4 W9 R3 I2 O3 W10 R3 W1 R4 R4 R7 
-W1 I15 O5 N1 R7 
-W7 R3 I12 O10 N1 R4 
+W1 I6 O5 I2 R3 I3 R4 R7 
+W15 I7 O5 R3 W15 R4 W9 R3 I6 O3 W10 R3 W1 R4 R4 R7 
+W1 I8 O5 N0 R7 
+W7 R3 I3 O10 N0 R4 
 R5 
-I14 R1 I15 R2 O5 I12 O6 N3 R7 
-I12 O13 N3 R7 
-I15 O20 /*--*/ R7 
+I7 R1 I8 R2 O5 I3 O6 N1 R7 
+I3 O13 N1 R7 
+I8 O20 /*--*/ R7 
 R6 
-W11 I14 R7 
+W11 I7 R7 
 R6 
 // Main 
 /* double
 comment
 */ 
-W1 W4 R3 W1 I0 R8 W19 W18 I1 R1 R2 R4 
+W1 W4 R3 W1 I9 R8 W19 W18 I10 R1 R2 R4 
 R5 
-W1 I2 O5 I3 R3 N0 R4 R7 
-W15 I4 O5 I5 R3 N0 R4 R7 
-W1 I6 O5 N1 R7 
-W12 R3 W1 I7 O5 N1 R7 I7 O8 I2 R7 I7 O20 R4 
+W1 I6 O5 I2 R3 N2 R4 R7 
+W15 I11 O5 I5 R3 N2 R4 R7 
+W1 I12 O5 N0 R7 
+W12 R3 W1 I13 O5 N0 R7 I13 O8 I6 R7 I13 O20 R4 
 R5 
-W5 R3 I7 O8 N2 O17 I7 O7 N1 R4 
-I8 R3 C0 R8 I7 R8 I4 R1 I7 R2 R4 R7 
-I6 O14 I4 R1 I7 R2 R7 
+W5 R3 I13 O8 N3 O17 I13 O7 N0 R4 
+I14 R3 C0 R8 I13 R8 I11 R1 I13 R2 R4 R7 
+I12 O14 I11 R1 I13 R2 R7 
 R6 
-I8 R3 C1 R8 I6 R4 R7 
-I9 R3 I4 R4 R7 
-W11 N1 R7 
+I14 R3 C1 R8 I12 R4 R7 
+W20 R3 I11 R4 R7 
+W11 N0 R7 
 R6 

test.txt

@@ -1,3 +1,20 @@
+int setDigitNumber(int num)
+{
+	int size = sizeNumber(num);
+	int* digits = (int*)malloc(size * sizeof(int));
+	int index = 0;
+	while (num != 0)
+	{
+		digits[index] = num % 10;
+		num /= 10;
+		index++/*--*/;
+	}
+	return digits;
+}
+// Main
+/* double
+comment
+*/
 int main(int argc, const char* argv[])
 {
 	int size = sizeNumber(36);