编译原理-语法分析器-源代码(function.h)

写在前面

仅供个人学习交流使用，疑问请联系 sunzhihao_future@nuaa.edu.cn .

源代码

#pragma once
#include<iostream>
#include<string>
#include<math.h>
#include<fstream>
#include<sstream>
#include<Windows.h>
#include"tree.h"
#include<stack>
bool success = 1;

using namespace std;

char ch;//字符变量，存放最新读进的源程序字符
char strToken[100];//字符数组，存放构成单词符号的字符串
int len = 0;//记录字符串的长度
string klabel[29] = { "+","-","*","/","=","#","<","<=",">",">=",",",";",":=","(",")",".","const","var","procedure","begin","end","odd","if","then","call"
,"while","do","read","write" };
string slabel[100] = {};
string  clabel[100] = {};
string  result[1000] = {};//保存所有单词的结果数组
int procedureId = 0;//记录当前的过程层数
int tableId = 0;//当前名字表的下标
int dx = 3;//当前层数的偏移地址
int ip = 0;//全局符号表的指针
int slen = 0;//标识符表的下标
int clen = 0;//常量表的下标
			 //判断是否为数字
const char *input;
int index = 0;
int codeId = 0;//代码的下标
bool isDigit()
{
	if (ch < 58 && ch >= 48)
		return true;
	else
		return false;
}
//判断是否为小写字母
bool issLetter()
{
	if (ch <= 122 && ch >= 97)
		return true;
	else
		return false;
}
bool isDigit(char ch1)
{
	if (ch1 < 58 && ch1 >= 48)
		return true;
	else
		return false;
}
//把字符串转化为数字
int strToint(string str)
{
	int len = str.length();
	int count = 0;
	for (int i = 0; i < len; i++)
	{
		if (str.at(i) <= 57 && str.at(i) >= 48)
			count = count + (str.at(i) - 48)*pow(10, len - i - 1);
		else
			return -1;
	}
	return count;
}
//把数字转化为字符串
//string intTostr(int num)
//{

//}
//判断是否为小写字母
bool issLetter(char ch1)
{
	if (ch1 <= 122 && ch1 >= 97)
		return true;
	else
		return false;
}
//判断是否为大写字母
bool islLetter()
{
	if (ch <= 90 && ch >= 65)
		return true;
	else
		return false;
}
//将下一输入字符读到ch中
void GetChar()
{
	ch = input[index];
	index++;

}
//判断ch中是否是空白，若是，则调用GetChar直至读入下一个非空白的字符
void GetBC()
{
	while (ch == 32)
		GetChar();
}
//将ch中的字符连接到strToken之后
void concat()
{
	strToken[len] = ch;
	len++;
}
//对strToken中的字符串查找保留字表，若他是一个保留字则返回则返回他的编码，否则返回0值
int Reserve()
{

	for (int i = 0; i < 29; i++)
	{
		/*const char *p = klabel[i].data();
		if (strcmp(p,strToken)==0)
		{
		return i;
		}*/
		if (klabel[i] == strToken)
			return i;
	}
	return -1;
}
//将搜索指示器回调一个字符位置
void Retract()
{
	index--;
	ch = 32;
}
//将strToken中的标识符插入到符号表
int insertId()
{
	slabel[slen] = strToken;
	slen++;
	return slen - 1;
}
//将strToken中的常数插入到常数表
int insertConst()
{
	clabel[clen] = strToken;
	clen++;
	return clen - 1;
}
string readFileIntoString(char * filename)
{
	ifstream ifile(filename);
	//将文件读入到ostringstream对象buf中
	ostringstream buf;
	char ch;
	while (buf&&ifile.get(ch))
		buf.put(ch);
	//返回与流对象buf关联的字符串
	return buf.str();
}
//检测是否已经存在此标识符
int isexists(string str)
{
	for (int i = 0; i < slen; i++)
		if (str == slabel[i])
			return 1;

	return 0;
}
//检测是否已经存在此常量
int  isexistc(string con)
{
	for (int i = 0; i < clen; i++)
		if (con == clabel[i])
			return 1;
	return -1;
}
int isexists()
{
	for (int i = 0; i < slen; i++)
		if (strToken == slabel[i])
			return i;

	return -1;
}
//检测是否已经存在此常量
int  isexistc()
{
	for (int i = 0; i < clen; i++)
		if (strToken == clabel[i])
			return i;
	return -1;
}
//名字表的结构体
struct symble
{
	string name;
	string kind;
	int addr;
	int attribute;//val/value 
}symlabel;
//判断是否退出
symble table[20];
//在符号表里查找某个标识符
int findSymble(string str)
{
	for (int i = 0; i < tableId; i++)
	{
		if (table[i].name == str)
			return i;
	}
	return -1;
}
//在符号表里根据地址查找变量的名字
string findSymble(int addr1)
{
	for (int i = 0; i < tableId; i++)
	{
		if (table[i].addr == addr1)
			return table[i].name;
	}
	return "";
}
//从关键字表查找关键字的下标
int findKlabel(string str)
{
	for (int i = 0; i < 29; i++)
	{
		if (str == klabel[i])
			return i+1;
	}
	return -1;
}
//主程序
void lex(string file1)
{
	int code, value, num = 0;
	const char *file_ = file1.c_str();
	std::ifstream in(file_);
	std::ostringstream tmp;
	tmp << in.rdbuf();
	std::string str = tmp.str();
	cout << str << endl;
	for (int i = 0; i < str.length(); i++)//如果输入中有大写字母，则转换为小写字母
		if (str.at(i) <= 90 && str.at(i) >= 65)
			str.at(i) = str.at(i) + 32;
	const char *file = str.data();
	input = file;

	while (input[index] != 0)
	{
		len = 0;
		//strcpy(strToken,"");
		memset(strToken, 0, sizeof(strToken));
		//cout << strToken << endl;
		//Sleep(1000);
		GetChar();
		GetBC();
		if (issLetter())//判断是否是字母
		{
			while (issLetter() || isDigit())
			{
				concat();
				GetChar();
			}
			Retract();
			result[ip] = strToken;
			ip++;
			code = Reserve();
			if (code == -1)//不在关键字表里，即为标识符
			{
				
				int index1 = isexists();//检测此标识符是否存在
				if (index1 != -1)
					cout << "(" << strToken << ",id," << index1 << ")" << endl;
				else
				{
					value = insertId();
					cout << "(" << strToken << ",id," << value << ")" << endl;//输出标识符的三元组

				}//cout << strToken<<endl;
			}
			else
			{
				cout << "(" << klabel[code] << "," << klabel[code] << ",-)" << endl;//输出关键字的二元组
			}
		}
		else if (isDigit())//如果是数字，即为常量
		{
			while (isDigit())
			{
				concat();
				GetChar();
			}
			Retract();
			result[ip] = strToken;
			ip++;
			int index2 = isexistc();
			if (index2 != -1)
				cout << "(" << strToken << ",int," << index2 << ")" << endl;
			else
			{
				value = insertConst();
				cout << "(" << strToken << ",int," << value << ")" << endl;
			}
		}
		/*else if (islLetter())
		{
		while(islLetter())
		{
		concat();
		GetChar();
		}
		Retract();
		code = Reserve();
		if (code == -1)
		cout << "拼写错误"<<endl;
		else
		cout << "(" << code << ",-)" << endl;//输出关键字的二元组
		}*/
		else//其余情况
		{
			switch (ch)
			{
			case '+':
				cout << "(+,+," << "-)" << endl;
				result[ip] = "+";
				ip++;
				break;
			case '-':
				cout << "(-,-," << "-)" << endl;
				result[ip] = "-";
				ip++;
				break;
			case '*':
				cout << "(*,*," << "-)" << endl;
				result[ip] = "*";
				ip++;
				break;
			case '/':
				cout << "(/,/," << "-)" << endl;
				result[ip] = "/";
				ip++;
				break;
			case '=':
				cout << "(=,=," << "-)" << endl;
				result[ip] = "=";
				ip++;
				break;
			case '#':
				cout << "(#,#," << "-)" << endl;
				result[ip] = "#";
				ip++;
				break;
			case '<':
				GetChar();
				if (ch == '=')
				{
					cout << "(<=,<=," << "-)" << endl;
					result[ip] = "<=";
					ip++;
				}
				else
				{
					Retract();
					cout << "(<,<," << "-)" << endl;
					result[ip] = "<";
					ip++;
				}
				break;
			case '>':
				GetChar();
				if (ch == '=')
				{
					cout << "(>=,>=," << "-)" << endl;
					result[ip] = ">=";
					ip++;
				}
				else
				{
					Retract();
					cout << "(>,>," << "-)" << endl;
					result[ip] = ">";
					ip++;
				}
				break;
			case ',':
				cout << "(,,,," << "-)" << endl;
				result[ip] = ",";
				ip++;
				break;
			case ';':
				cout << "(;,;," << "-)" << endl;
				result[ip] = ";";
				ip++;
				break;
			case ':':
				GetChar();
				if (ch == '=')
				{
					cout << "(:=,:=," << "-)" << endl;
					result[ip] = ":=";
					ip++;
				}
				else
				{
					Retract();
					cout << "(:,:," << "-)" << endl;
					result[ip] = ":";
					ip++;
				}
				break;
			case '(':
				cout << "((,(," << "-)" << endl;
				result[ip] = "(";
				ip++;
				break;
			case ')':
				cout << "(),)," << "-)" << endl;
				result[ip] = ")";
				ip++;
				break;
			case '.':
				cout << "(.,.," << "-)" << endl;
				result[ip] = ".";
				ip++;
				break;
			case 10://排除掉换行符
				break;
			default:
				cout << "拼写错误:" << ch << endl;
				break;
			}
		}
	}
}

//函数声明
void subProgram(treeNode<string> *tN);
void conExplain(treeNode<string> *tN);
void varExplain(treeNode<string> *tN);
void processExplain(treeNode<string> *tN);
void constDef(treeNode<string> *tN);
void statement(treeNode<string> *tN);
void varExplain(treeNode<string> *tN);
void id(treeNode<string> *tN);
void unsInt(treeNode<string> *tN);
void dig(treeNode<string> *tN,int index);

void processHead(treeNode<string> *tN);
void AssignmentStatement(treeNode<string> *tN);
void expression(treeNode<string> *tN);
void CompoundStatement(treeNode<string> *tN);
void conditions(treeNode<string> *tN);
void AddAndSubtract(treeNode<string> *tN);
void item(treeNode<string> *tN);
void factor(treeNode<string> *tN);
void MULAndDIV(treeNode<string> *tN);
void ConditionStatement(treeNode<string> *tN);
void relationship(treeNode<string> *tN);
void processCall(treeNode<string> *tN);
void readStatement(treeNode<string> *tN);
void dowhile(treeNode<string> *tN);
void writeStatement(treeNode<string> *tN);
void letter(treeNode<string> *tN,int index);
void digit(treeNode<string> *tN,int index);

treeNode<string> *Tprogram=new treeNode<string>(2,"<程序>");

void  program()//程序
{
	ip = 0;
	treeNode<string> *TsubProgram = new treeNode<string>(4,"<分程序>");
	subProgram(TsubProgram);
	if (result[ip] == ".")
	{
		Tprogram->child[0] = TsubProgram;
		Tprogram->child[1] = new treeNode<string>(".");
		cout << "成功";
	}
	else
		exit(0);
}

void subProgram(treeNode<string> *tN)//分程序
{

	int count = 4;
	int tempTableId = tableId;
	//常量说明部分
	if (result[ip] == "const")
	{   
		treeNode<string> *TconExplain = new treeNode<string>("<常量说明部分>");
		conExplain(TconExplain);
		count++;
		tN->child[0] = TconExplain;
	}
	//变量说明部分
	if (result[ip] == "var")
	{
		treeNode<string> *TvarExplain = new treeNode<string>("<变量说明部分>");
		varExplain(TvarExplain);
		count++;
		tN->child[1] = TvarExplain;
	}
	//过程说明部分
	if (result[ip] == "procedure")
	{
		treeNode<string> *TprocessExplain = new treeNode<string>("<过程说明部分>");
		processExplain(TprocessExplain);
		count++;
		tN->child[2] = TprocessExplain;
	}
	//cout<<tempTableId<<endl;
	if (table[tempTableId].kind == "proc")
			table[tempTableId].addr = codeId;
	treeNode<string> *Tstatement = new treeNode<string>(1,"<语句>");
	statement(Tstatement);//语句
	
	tN->child[3]=Tstatement;
	
}
void conExplain(treeNode<string> *tN)//常量说明部分
{
	if (result[ip] == "const")
	{
		ip++;
		tN->child[0] = new treeNode<string>("const");
		treeNode<string> *TconstDef1 = new treeNode<string>(3, "常量定义");
		tN->child[1] = TconstDef1;
		constDef(TconstDef1);
		int count = 0;
		while (result[ip] == ",")
		{   
			count++;//树的孩子数
			tN->child[2*count] = new treeNode<string>(",");
			treeNode<string> *TconstDef2 = new treeNode<string>(3,"常量定义");
			tN->child[2*count+1] = TconstDef2;
			ip++;
			constDef(TconstDef2);
		}
		if (result[ip] == ";")
		{
			ip++;
			//增加树的结构
			tN->child[2*count + 2] = new treeNode<string>(";");
		}
		else
			exit(0);
	}
	else
		exit(0);
}
void varExplain(treeNode<string> *tN)//变量说明部分
{
	if (result[ip] == "var")
	{
		ip++;
		tN->child[0] = new treeNode<string>("var");
		treeNode<string> *Tid1 = new treeNode<string>(3, "<标识符>");
		tN->child[1] = Tid1;
		table[tableId].name = result[ip];
		table[tableId].attribute = procedureId;
		table[tableId].addr = dx;
		table[tableId].kind = "var";
		tableId++;
		dx++;
		id(Tid1);
		int count = 0;
		while (result[ip] == ",")
		{
			ip++;
			count++;
			tN->child[2 * count] = new treeNode<string>(",");
			treeNode<string> *Tid2 = new treeNode<string>(3, "<标识符>");
			tN->child[2 * count + 1] = Tid2;
			table[tableId].name = result[ip];
			table[tableId].attribute = procedureId;
			table[tableId].addr = dx;
			table[tableId].kind = "var";
			tableId++;
			dx++;
			id(Tid2);
		}
	
		if (result[ip] == ";")
		{
			ip++;
			tN->child[count + 1] = new treeNode<string>(";");
		}
	   else
		   exit(0);
	}
	else
		exit(0);
}
void processExplain(treeNode<string> *tN)//过程说明部分
{
	procedureId++;//层数加1
	dx = 3;//当前层数内地址变为1
	treeNode<string> *TprocessHead = new treeNode<string>(3,"<过程首部>");
	tN->child[0] = TprocessHead;
	treeNode<string> *TsubProgram = new treeNode<string>( "<分程序>");
	tN->child[1] = TsubProgram;
	processHead(TprocessHead);
	subProgram(TsubProgram);
	if (result[ip] == ";")
	{   
		tN->child[2] = new treeNode<string>(";");
		procedureId--;
		ip++;
		int count=0;
		while (result[ip]=="procedure")
		{
			count++;
			treeNode<string> *TprocessExplain = new treeNode<string>("<过程说明部分>");
			tN->child[count + 2] = TprocessExplain;
			processExplain(TprocessExplain);
		}

	}
	    else
			exit(0);
}
void statement(treeNode<string> *tN)//语句
{
	if (isexists(result[ip]))//赋值语句
	{
		treeNode<string> *TAssignmentStatement = new treeNode<string>(3,"<赋值语句>");
		tN->child[0] = TAssignmentStatement;
		AssignmentStatement(TAssignmentStatement);
	}
	else if (result[ip] == "if")//条件语句
	{
		treeNode<string> *TConditionStatement = new treeNode<string>(3,"<条件语句>");
		tN->child[0] = TConditionStatement;
		ConditionStatement(TConditionStatement);
	}
	else if (result[ip] == "while")//当型循环
	{
		treeNode<string> *Tdowhile = new treeNode<string>(3,"<循环语句>");
		tN->child[0] = Tdowhile;
		dowhile(Tdowhile);
	}
	else if (result[ip] == "call")//过程调用	
	{
		treeNode<string> *Tcall= new treeNode<string>(2, "<过程调用语句>");
		tN->child[0] = Tcall;
		processCall(Tcall);
	}
	else if (result[ip] == "read")//读语句
	{
		treeNode<string> *Tread = new treeNode<string>(2, "<读语句>");
		tN->child[0] = Tread;
		readStatement(Tread);
	}
	else if (result[ip] == "write")//写语句	
	{
		treeNode<string> *Twrite = new treeNode<string>(2, "<写语句>");
		tN->child[0] = Twrite;
		writeStatement(Twrite);
	}
	else if (result[ip] == "begin")//复合语句
	{
		treeNode<string> *TCompoundStatement = new treeNode<string>(2, "<复合语句>");
		tN->child[0] = TCompoundStatement;
		CompoundStatement(TCompoundStatement);
	}
	
}
void constDef(treeNode<string> *tN)//常量定义
{ 
	treeNode<string> *Tid = new treeNode<string>( "<标识符>");
	tN->child[0] = Tid;
	table[tableId].name = result[ip];
	table[tableId].kind = "const";
	id(Tid);
	if (result[ip] == "=")
	{
		tN->child[1] = new treeNode<string>("=");
		ip++;
		treeNode<string> *TunsInt = new treeNode<string>("<无符号整数>");
		tN->child[2] = TunsInt;
		table[tableId].attribute = strToint(result[ip]);
		tableId++;
		unsInt(TunsInt);
	}
	else
		exit(0);
}

void id(treeNode<string> *tN)//标识符
{
	/*if (isexists(result[ip]))
	{
		tN->child[0] = new treeNode<string>(result[ip]);
		ip++;
	}
	else
		exit(0);
		*/
	int index=0;
	treeNode<string> *Tletter1 = new treeNode<string>("<字母>");
	tN->child[0] = Tletter1;
	letter(Tletter1,0);
	index++;
	int max = result[ip].length();
	
	for (index=1; index < max && ((result[ip].at(index) >= 97 && result[ip].at(index) <= 122) ||
		(result[ip].at(index) >= 48 && result[ip].at(index) <= 57)); index++)
		{
			if (result[ip].at(index) >= 97 && result[ip].at(index) <= 122)
			{
				treeNode<string> *Tletter2 = new treeNode<string>("<字母>");
				tN->child[index] = Tletter2;
				letter(Tletter2, index);
			}
			else
			{
				treeNode<string> *Tdig = new treeNode<string>("<数字>");
				tN->child[index] = Tdig;
				dig(Tdig, index);
			}
		}
	ip++;
}
void unsInt(treeNode<string> *tN)//无符号整数
{
	/*if (isexistc(result[ip]))
	{
		tN->child[0] = new treeNode<string>(result[ip]);
		ip++;
	}
	else
		exit(0);*/
	int index = 0;
	treeNode<string> *Tdig1 = new treeNode<string>("<数字>");
	tN->child[0] = Tdig1;
	dig(Tdig1, 0);
	index++;
	int max = result[ip].length();

	for (index = 1; index < max && (result[ip].at(index) >= 48 && result[ip].at(index) <= 57); index++)
	{
		if (result[ip].at(index) >= 48 && result[ip].at(index) <= 57)
		{
			treeNode<string> *Tdig2 = new treeNode<string>("<数字>");
			tN->child[index] = Tdig2;
			dig(Tdig2, index);
		}
	}
	ip++;
}
void letter(treeNode<string> *tN,int index1)
{   
	if (result[ip].at(index1) >= 97 && result[ip].at(index1) <= 122)
	{
		string str;
		stringstream stream;
		stream << result[ip].at(index1);
		str = stream.str();//将char转换为string
		tN->child[0] = new treeNode<string>(str);
	}
	else
		exit(0);
}
void dig(treeNode<string> *tN,int index)//数字
{
	if (result[ip].at(index) <= 57 && result[ip].at(index) >= 48)
	{
		string str;
		stringstream stream;
		stream << result[ip].at(index);
		str = stream.str();//将char转换为string
		tN->child[0] = new treeNode<string>(str);
	}
	else
		exit(0);
}
void processHead(treeNode<string> *tN)//过程首部
{
	if (result[ip] == "procedure")
	{
		ip++;
		tN->child[0] = new treeNode<string>("procedure");
		treeNode<string> *Tid = new treeNode<string>("<标识符>");
		tN->child[1] = Tid;
		/******/
		table[tableId].kind = "proc";
		table[tableId].name = result[ip];
		table[tableId].addr = codeId;
		table[tableId].attribute = procedureId-1;
		tableId++;
		id(Tid);
		/****************/
		if (result[ip] == ";")
		{
			ip++;
			tN->child[1] = new treeNode<string>(";");
			
		}
		else
			exit(0);
	}
	else
		exit(0);
}
void AssignmentStatement(treeNode<string> *tN)//赋值语句
{
	treeNode<string> *Tid = new treeNode<string>("<标识符>");
	tN->child[0] = Tid;
	int tempIp = ip;//暂存ip
	id(Tid);
	if (result[ip] == ":=")
	{
		ip++;
		tN->child[1] = new treeNode<string>(":=");
		treeNode<string> *Texpression = new treeNode<string>("<表达式>");
		tN->child[3] = Texpression;
		expression(Texpression);
	}
	else
		exit(0);
}
void expression(treeNode<string> *tN)//表达式
{
	if (result[ip] == "+" || result[ip] == "-")
	{
		ip++;
		tN->child[0] = new treeNode<string>(result[ip]);
	}
	treeNode<string> *Titem = new treeNode<string>("<项>");
	tN->child[1]=Titem;
	item(Titem);
	int count = 0;
	while (result[ip] == "+" || result[ip] == "-")
	{
		count++;
		treeNode<string> *TAddAndSubtract = new treeNode<string>("<加减运算符>");
		tN->child[2*count] = TAddAndSubtract;
		treeNode<string> *Titem = new treeNode<string>("<项>");
		tN->child[2 * count+1] = Titem;
		int tempIp = ip;//暂存Ip
		AddAndSubtract(TAddAndSubtract);
		item(Titem);
	}
	
}
void CompoundStatement(treeNode<string> *tN)//复合语句
{
	if (result[ip] == "begin")
	{
		tN->child[0] = new treeNode<string>("begin");
		ip++;
		treeNode<string> *Tstatement1 = new treeNode<string>("<语句>");
		tN->child[1] = Tstatement1;
		statement(Tstatement1);
		int count = 0;
		while (result[ip] == ";")
		{
			ip++;
			count++;
			tN->child[2 * count] = new treeNode<string>(";");
			treeNode<string> *Tstatement2 = new treeNode<string>("<语句>");
			tN->child[2 * count + 1] = Tstatement2;
			statement(Tstatement2);

		}
		if (result[ip] == "end")
		{
			tN->child[2 * count+2] = new treeNode<string>("end");
			ip++;
		}
		else
			exit(0);
	}
	else
		exit(0);

}
void conditions(treeNode<string> *tN)//条件
{ 
	
	 if (result[ip] == "odd")
	 {
		 ip++;
		 tN->child[0] =new  treeNode<string>("odd");
		 treeNode<string> *Texpression = new treeNode<string>("<表达式>");
		 expression(Texpression);tN->child[1] = Texpression;
	}
	 else 
	{
		 treeNode<string> *Texpression1 = new treeNode<string>("<表达式>");
		 tN->child[0] = Texpression1;
		expression(Texpression1);
		treeNode<string> *Trealationship = new treeNode<string>("<关系运算符>");
		tN->child[1] = Trealationship;
		int tempIp = ip;//保存ip
		relationship(Trealationship);
		treeNode<string> *Texpression2 = new treeNode<string>("<表达式>");
		tN->child[2] = Texpression2;
		expression(Texpression2);
	}
}
void item(treeNode<string> *tN)//项
{
	treeNode<string> *Tfactor1 = new treeNode<string>("<因子>");
	tN->child[0] = Tfactor1;
	factor(Tfactor1);
	int count = 0;
	while (result[ip]=="*"|| result[ip] == "/")
	{
		count++;
		treeNode<string> *TMULAndDIV = new treeNode<string>("<乘除运算符>");
		tN->child[2*count-1] = TMULAndDIV;
		int tempIp = ip;//暂存Ip
		MULAndDIV(TMULAndDIV);
		treeNode<string> *Tfactor2 = new treeNode<string>("<因子>");
		tN->child[2*count] = Tfactor2;
		factor(Tfactor2);
	}
}
void factor(treeNode<string> *tN)//因子
{
	if ((result[ip].at(0) <= 122 && result[ip].at(0) >= 97))
	{
		treeNode<string> *Tid = new treeNode<string>("<标识符>");
		tN->child[0] = Tid;
		
		id(Tid);
	}
	else if ((result[ip].at(0) <= 57 && result[ip].at(0) >= 48))
	{
		treeNode<string> *TunsInt = new treeNode<string>("<无符号整数>");
		tN->child[0] = TunsInt;
		unsInt(TunsInt);
	}
	else if ((result[ip] == "("))
	{
		tN->child[0] = new treeNode<string>("(");
		treeNode<string> *Texpression = new treeNode<string>("<表达式>");
		tN->child[1] = Texpression;
		expression(Texpression);
		if (result[ip] == ")")
		{
			tN->child[2] = new treeNode<string>(")");
			ip++;
		}
		else
			exit(0);
 	}
	else
		exit(0);

}
void AddAndSubtract(treeNode<string> *tN)//加减运算符
{
	if (result[ip] == "+" || result[ip] == "-")
	{
		tN->child[0] = new treeNode<string>(result[ip]);
		ip++;
	}
	else
		exit(0);
}
void MULAndDIV(treeNode<string> *tN)//乘除运算符
{
	if (result[ip] == "*" || result[ip] == "/")
	{
		tN->child[0] = new treeNode<string>(result[ip]);
		ip++;
	}
	else
		exit(0);
}
void relationship(treeNode<string> *tN)//关系运算符
{
	if (result[ip] == "=" || result[ip] == "#"||result[ip]=="<"|| result[ip] == "<="||result[ip] == ">"
		||result[ip] == ">=")
	{
		tN->child[0] = new treeNode<string>(result[ip]);
		ip++;
	}
	else
		exit(0);
}
void ConditionStatement(treeNode<string> *tN)//条件语句
{
	if (result[ip] == "if")
	{
		tN->child[0] = new treeNode<string>("if");
		ip++;
		treeNode<string> *Tconditions = new treeNode<string>("<条件>");
		tN->child[1] = Tconditions;
		conditions(Tconditions);
		if (result[ip] == "then")
		{
			ip++;
			tN->child[0] = new treeNode<string>("then");
			treeNode<string> *Tstatement = new treeNode<string>("<语句>");
			tN->child[1] = Tstatement;
			statement(Tstatement);
		}
		else
			exit(0);
	}
	else
		exit(0);
}
void processCall(treeNode<string> *tN)//过程调用语句
{
	if (result[ip] == "call")
	{
		ip++;
		treeNode<string> *Tid = new treeNode<string>("<标识符>");
		tN->child[0] = Tid;
		id(Tid);
	}
	else
		exit(0);
}
void dowhile(treeNode<string> *tN)//循环
{
	if (result[ip] == "while")
	{
		tN->child[0] = new treeNode<string>("while");
		ip++;
		int tempAddr = codeId+1;//while循环的入口地址
		treeNode<string> *Tconditions = new treeNode<string>("<条件>");
		tN->child[1] = Tconditions;
		conditions(Tconditions);
		if (result[ip] == "do")
		{
			tN->child[2] = new treeNode<string>("do");
			ip++;
			treeNode<string> *Tstatement = new treeNode<string>("<语句>");
			tN->child[3] = Tstatement;
			statement(Tstatement);
		}
		else
			success = 0;
	}
	else
		exit(0);
}
void readStatement(treeNode<string> *tN)//读语句
{
	if (result[ip] == "read")
	{
		tN->child[0] = new treeNode<string>("read");
		ip++;
		if (result[ip] == "(")
		{
			tN->child[1] = new treeNode<string>("（");
			ip++;
			treeNode<string> *Tid1 = new treeNode<string>("<标识符>");
			tN->child[2] = Tid1;
			id(Tid1);
			int count = 0;
			while (result[ip] == ",")
			{
				count++;
				tN->child[2*count+1] = new treeNode<string>(",");
				ip++;
				treeNode<string> *Tid2 = new treeNode<string>("<标识符>");
				tN->child[2*count+2] = Tid2;
				id(Tid2);

			}
			if (result[ip] == ")")
			{
				tN->child[2*count+3] = new treeNode<string>(")");
				ip++;
			}
			else
				exit(0);

		}
		else
			exit(0);
	}
	else
		exit(0);
}
void writeStatement(treeNode<string> *tN)//写语句
{
	if (result[ip] == "write")
	{
		tN->child[0] = new treeNode<string>("write");
		ip++;
		if (result[ip] == "(")
		{
			ip++;
			tN->child[1] = new treeNode<string>("(");
			treeNode<string> *Texpression1 = new treeNode<string>("<表达式>");
			tN->child[2] = Texpression1;
			expression(Texpression1);
			int count = 0;
			while (result[ip] == ",")
			{
				count++;
				ip++;
				
				tN->child[2 * count + 1] = new treeNode<string>(",");
				treeNode<string> *Texpression2 = new treeNode<string>("<表达式>");
				tN->child[2 * count + 2] = Texpression2;
				expression(Texpression2);
			}
			if (result[ip] == ")")
			{
				tN->child[2 * count + 3] = new treeNode<string>(")");
				ip++;
			}
			else
				exit(0);

		}
		else
			exit(0);
	}
	else
		exit(0);
}

int findSymbleAddr(int addr1)
{
	for (int i = 0; i < tableId; i++)
		if (table[i].kind == "proc"&&table[i].addr == addr1)
			return table[i].attribute;
}