编译原理 词法分析器和算符优先分析算法（C++)

词法分析器↓↓↓

完整代码如下：

#include <iostream>
#include <string>
using namespace std;
int index = 0;
int what(char a)
{
	if ((int(a) >= 48) && (int(a) <= 57))
	{
		return 0;//0-9数字
	}
	else
		if (((int(a) >= 97) && (int(a) <= 122))|| ((int(a) >= 65) && (int(a) <= 90)))
		{
			return 1;//字母
		}
		else
		{
			return 2;//其他的标点符号
		}
}
void scan(char a[], int& m)
{
	char zh[100];
	int b = 0, r = 0;
	int j = 0;
	int zbbm;
	//-----------检测整形常数
	while (a[m] == ' ')
	{
		cout << "遇到空格" << endl;
		m++;
	}
	if (what(a[m]) == 0)
	{
		while (what(a[m]) == 0)
		{
			b = b * 10 + int(a[m]) - 48;
			m++;
		}
		zbbm = 7;
		cout << "(" << zbbm << "," << b << ")" << endl;
	}
	else
		//-----检测字符型
		if (what(a[m] == 1))
		{
			if ((a[m] == 'b') && (a[m + 1] == 'e') && (a[m + 2] == 'g') &&
				(a[m + 3] == 'i') && (a[m + 4] == 'n') && (what(a[m + 5]) == 2))
			{
				m = m + 5;
				zbbm = 1;
				cout << "(" << zbbm<<",-)" << endl;
			}//===检测begin
			else
				if ((a[m] == 'i') && (a[m + 1] == 'f') && (what(a[m + 2]) == 2))
				{
					m = m + 2;
					zbbm = 2;
					cout << "(" << zbbm << ",-)" << endl;
				}//检测if
				else
					if ((a[m] == 't') && (a[m + 1] == 'h') && (a[m + 2] == 'e')
						&& (a[m + 3] == 'n') && (what(a[m + 4]) == 2))
					{
						m = m + 4;
						zbbm = 3;
						cout << "(" << zbbm<<",-)" << endl;
					}//检测then
					else
						if ((a[m] == 'e') && (a[m + 1] == 'l') && (a[m + 2] == 's')
							&& (a[m + 3] == 'e') && (what(a[m + 4]) == 2))
						{
							m = m + 4;
							zbbm = 4;
							cout << "(" << zbbm<<",-)" << endl;
						}//检测else
						else
							if ((a[m] == 'e') && (a[m + 1] == 'n') && (a[m + 2] == 'd')
								&& (what(a[m + 3]) == 2))
							{
								m = m + 3;
								zbbm = 5;
								cout << "(" << zbbm<<",-)" << endl;
							}//检测end

							//------检测未知字符
							else
							{
								bool exist=false;
								for (int i = 0; i < j; i++)//检测zh数组里是否存在a[m]字符
								{
									if (zh[i] == a[m])
									{
										index=i;
										exist = true;
										break;
									}
								}
								if (!exist)
								{
									zh[j] = a[m];
									j++;
									index++;
								}
								
								zbbm = 6;
								m++;
								cout << "(" << zbbm << "," << index << ")" << endl;
							}
		}
		else if(what(a[m])== 2)
		{
			if (a[m] == '+')
			{
				zbbm = 8;
				m++;
				cout << "(" << zbbm << ",)" << endl;
			}//检测+
			else
				if (a[m] == '(')
				{
					zbbm = 11;
					m++;
					cout << "(" << zbbm << ",-)" << endl;
				}//检测(
				else
					if (a[m] == ')')
					{
						zbbm = 12;
						m++;
						cout << "(" << zbbm << ",-)" << endl;
					}//检测 )
					else
						if (a[m] == '*')
						{
							if (a[m + 1] == '*')
							{
								zbbm = 10;
								m += 2;
							}
							else
							{
								zbbm = 9;
								m++;
							}
							cout << "(" << zbbm << ",-)" << endl;
					}
		}
}
int main()
{

	
	cout << "begin---------1" << endl;
	cout << "if---------2" << endl;
	cout << "then---------3" << endl;
	cout << "else---------4" << endl;
	cout << "end---------5" << endl;
	cout << "标志符---------6" << endl;
	cout << "整形常数---------7" << endl;
	cout << "+---------8" << endl;
	cout << "*---------9" << endl;
	cout << "**---------10" << endl;
	cout << "(---------11" << endl;
	cout << ")---------12" << endl;
	cout << "===================================" << endl;
	cout << endl;
	int m = 0;
	char a[100];
	cout << "请输入测试语句:";
	cin.getline(a, 100);
	cout << "输出格式为:  (种别编码，单词的属性值)" << endl;
	while (a[m] != '#')
	{
		scan(a, m);
	}
	return 0;
}

输入语句为if a = b then#

流程图：

算符优先分析程序↓↓↓

完整代码如下：

#include <iostream>
#include <malloc.h>
using namespace std;

struct Lchar
{
	char char_ch;
	struct Lchar* next;
}LLchar, * p, * h, * temp, * top, * base;

int table[7][7] ={ 
{1,-1,-1,-1,-1,1,1},
{1,1,-1,-1,-1,1,1},
{1,1,-1,-1,-1,1,1},
{1,1,1,0,0,1,1},
{-1,-1,-1,-1,-1,-1,0},
{1,1,1,0,0,1,1},
{-1,-1,-1,-1,-1,0,-1} };
//存储算分优先关系表，大于为1,小于或等于为-1，其他为0表示出

char curchar;//待比较字符
char curcmp;//比较字符
int i, j;//table数组坐标
int k;//记N器

int push(char pchar)/*入栈函数*/
{
	temp = (Lchar*)malloc(sizeof(LLchar));
	temp->char_ch = pchar;
	temp->next = top;
	top = temp;
	return 0;
}

int pop()/*出栈函数*/
{
	if (top->char_ch != '#')
		top = top->next;
	return 0;
}

int change(char ch)/*将字符转为数字，以得到算符优先值*/
{
	int t;
	switch (ch)
	{
	case '+':t = 0; break;
	case '*':t = 1; break;
	case '|':t = 2; break;
	case 'i':t = 3; break;
	case '(':t = 4; break;
	case ')':t = 5; break;
	case '#':t = 6;
	}
	return t;
}

int fenxi()
{
	int right = 0;
	k = 1;
	for (;;)
	{
		curchar = h->char_ch;
		temp = top;
		for (;;)
		{
			if (temp->char_ch == 'N')
			{
				temp = temp->next;
				k++;
			}
			else
			{
				curcmp = temp->char_ch;
				break;
			}
		}
		cout << endl << table[i][j] << " " << " ";
		temp = top;//temp指针到栈顶准备打印
		for (;;)/*打印栈*/
		{
			cout << temp->char_ch;
			if (temp->char_ch == '#')
				break;
			else
				temp = temp->next;
		}
		cout << " ";
		temp = h;//temp指针到待比较字符栈顶准备打印
		for (;;)/*打印待比较的字符*/
		{
			cout << temp->char_ch;
			if (temp->char_ch == '#')
				break;
			else
				temp = temp->next;
		}
		i = change(curcmp);
		j = change(curchar);
		if (table[i][j] == 0)/*算符优先值为空*/
		{
			cout << endl << "错误" << " " << table[i][j] << " " << " " << curcmp << " " << curchar;
			right = 0;
			break;
		}
		else		/*算符优先值不为空*/
		{
			if (table[i][j] < 0)/*算符优先值为-1，移进*/
			{
				if (curchar == '#')/*待比较字符为空*/
				{
					if (k == 2)
						break;
					else
					{
						cout << endl << "错误" << " " << table[i][j] << " " << " " << curcmp << " " << curchar;
						right = 0;
						break;
					}
				}
				push(curchar);
				k = 1;
				curcmp = curchar;
				h = h->next;
			}
			else		/*算符优先值为1，归约*/
			{
				if (curcmp == 'i')/*当前比较为i，出栈一次*/
					pop();
				else//当前比较不为i，出栈三次 例：把N*N变为N
				{
					pop();
					pop();
					pop();
				}
				push('N');/*归约到N*/
				k = 1;
			}
		}
	}
	return 0;
}
int main(void)
{
	char ch;
	int right = 1;
	base = (Lchar*)malloc(sizeof(LLchar));//初始一个base指针存栈顶的#
	base->next = NULL;
	base->char_ch = '#';
	top = base;//栈顶指针指向base
	h = (Lchar*)malloc(sizeof(LLchar));
	h->next = NULL;
	p = h;//p指针暂存h，链头位置
	cout << "输入待比较字符串，以'#'结束" << endl;
	do {
		cin >> ch;
		if (ch == 'i' || ch == '+' || ch == '*' || ch == '|' || ch == '(' || ch == ')' || ch == '#')
		{
			temp = (Lchar*)malloc(sizeof(LLchar));//尾插建链
			temp->next = NULL;
			temp->char_ch = ch;
			h->next = temp;
			h = h->next;
		}
		else
		{
			cout << "输入错误，请重新输入，以#结束" << endl;
		}
	} while (ch != '#');/*输入待比较字符串，以'#'结束*/
	p = p->next;
	h = p;//此时指针指向链表的第一个待比较字符
	fenxi();/*开始识别*/
	if (right)
		cout << endl << "YES" << endl;
	else
		cout << endl << "NO" << endl;
	return 0;
}

输入语句：i+i*i#

流程图：

----设计思想----
1．词法分析器设计
（1）首先要读入源文件也就是输入语句到缓冲区。
（2）其次从缓冲区读入一个非空字符，计数+1，判别是什么类型的字符，再继续读入字符，每次读入字符计数都加1，直到一个单词读完或是遇到单词分隔符。
（3）通过首字符以此判断该单词属于什么类型的词法。
（4）将识别出来的单词，按照其种别编码输出内部表示方式。若不在词法表里就按标识符的种别编码填入信息，地址并输出。
2. 算符优先分析程序设计
（1）首先将优先关系表建成矩阵存储，将输入字符串建成链表存入输入缓冲区。
（2）其次从缓冲区读入一个终结符与比较栈内的栈顶终结符进行优先关系比较。若大于栈内则入栈，否则将栈顶句柄进行归约。输出优先关系、栈、输入缓冲区当前状态。
（3）判断输入缓冲区是否为空，不空执行（2），若为空结束。