📄 compiler1.cpp

📁 实现了简单的Simple语言的编辑器,包括词法分析,语法分析,生成四元式,以及生成符号表功能,在符号表中还可以进行查询与删除.
💻 CPP
📖 第 1 页 / 共 4 页
字号:
上一页 1 2 34
		return FALSE;
	}
//yy
	int level=lookupp(GetCurSym()->text);
	yuyivalue.disp=level;
	if (level>yuyivar.currbl+1)
	{
		m_nErrorNum=40;
		m_nErrorAddress=m_pCurSym;
		return FALSE;
	}
//yy end
	NextSym();
	switch (GetCurSym()->type)
	{
	case 33://(
		break;
	default:
		return TRUE;
	}
	if (!r_ShiChanBiao()) return FALSE;
//yy
	gen("call",1,leveltab[level].parnum,1,level,2,leveltab[level].lnp);
//yy end
	return TRUE;
}

int CCompiler::r_ShiChanBiao()
{
//yy
	int pp=yuyivalue.disp;
	int parp=leveltab[pp].pointer;
	int n=0;
	int i,j,k,t;
//yy end
	switch (GetCurSym()->type)
	{
	case 33://(
		break;
	default:
		m_nErrorNum=16;
		m_nErrorAddress=m_pCurSym;
		return FALSE;
	}
	NextSym();
	if (!r_BiaoDaShi()) return FALSE;
//yy
	if (n<=leveltab[pp].parnum)
	{
		i=yuyivalue.Etyp;
		j=yuyivalue.Evalue;
		switch (i)
		{
		case 1:
			m_nErrorNum=36;
			m_nErrorAddress=m_pCurSym;
			return FALSE;
		case 2:
			k=temptab[j].taddr;
			t=temptab[j].typ;
			i++;
			break;
		default:
			k=idtab[j].addr;
			t=idtab[j].typ;
			i++;
		}
		if ((i==3) && (idtab[parp].kind==4))
		{
			m_nErrorNum=37;
			m_nErrorAddress=m_pCurSym;
			return FALSE;
		}
		if (t>idtab[parp].typ)
		{
			m_nErrorNum=35;
			m_nErrorAddress=m_pCurSym;
			return FALSE;
		}
		gen("par",i,k,0,0,0,0);
		if (i==3) temptab[j].used=FALSE;
		n++;parp++;
	}
//yy end
	while (GetCurSym()->type==32)//,
	{
		NextSym();
		if (!r_BiaoDaShi()) return FALSE;
//yy
		if (n<=leveltab[pp].parnum)
		{
			i=yuyivalue.Etyp;
			j=yuyivalue.Evalue;
			switch (i)
			{
			case 1:
				m_nErrorNum=36;
				m_nErrorAddress=m_pCurSym;
				return FALSE;
			case 2:
				k=temptab[j].taddr;
				t=temptab[j].typ;
				i++;
				break;
			default:
				k=idtab[j].addr;
				t=idtab[j].typ;
				i++;
			}
			if ((i==3) && (idtab[parp].kind==4))
			{
				m_nErrorNum=37;
				m_nErrorAddress=m_pCurSym;
				return FALSE;
			}
			if (t>idtab[parp].typ)
			{
				m_nErrorNum=35;
				m_nErrorAddress=m_pCurSym;
				return FALSE;
			}
			gen("par",i,k,0,0,0,0);
			if (i==3) temptab[j].used=FALSE;
			n++;parp++;
		}
//yy end
	}
//yy
	if (n<leveltab[pp].parnum)
	{
		m_nErrorNum=38;
		m_nErrorAddress=m_pCurSym;
		return FALSE;
	}
//yy end
	switch (GetCurSym()->type)
	{
	case 34://)
		break;
	default:
		m_nErrorNum=17;
		m_nErrorAddress=m_pCurSym;
		return FALSE;
	}
	NextSym();
	return TRUE;
}

int CCompiler::r_BiaoDaShi()
{
	int i1,i2,j1,j2,t1,t2,k1,k2,i,j,t,k;
	if (!r_Xiang()) return FALSE;
//yy
	i=yuyivalue.Etyp;
	j=yuyivalue.Evalue;
	i1=i;j1=j;
	switch (i1)
	{
	case 1:
		t1=1;k1=j1;break;
	case 2:
		t1=temptab[j1].typ;
		k1=temptab[j1].taddr;
		break;
	default :
		t1=idtab[j1].typ;
		k1=idtab[j1].addr;
	}
//yy end
	while (GetCurSym()->type==16)//+
	{
		NextSym();
		if (!r_Xiang()) return FALSE;
//yy
		i2=yuyivalue.Etyp;
		j2=yuyivalue.Evalue;
		switch (i2)
		{
		case 1:
			t2=1;k2=j2;break;
		case 2:
			t2=temptab[j2].typ;
			k2=temptab[j2].taddr;
			break;
		default :
			t2=idtab[j2].typ;
			k2=idtab[j2].addr;
		}
		t=(t1>t2)?t1:t2;
		j=newtemp(t);
		k=temptab[j].taddr;
		if (i1==1)
			if (i2==1)
				gen("+I",1,j1,1,j2,3,k);
			else
				if (t2==1)
					gen("+I",1,j1,i2+1,k2,3,k);
				else
					gen("+R",1,j1,i2+1,k2,3,k);
		else
			if (i2==1)
				if (t1==1)
					gen("+I",i1+1,k1,1,j2,3,k);
				else
					gen("+R",i1+1,k1,1,j2,3,k);
			else
				if ((t1==1) && (t2==1))
					gen("+I",i1+1,k1,i2+1,k2,3,k);
				else
					gen("+R",i1+1,k1,i2+1,k2,3,k);
		if (i1==2) temptab[j1].used=FALSE;
		if (i2==2) temptab[j2].used=FALSE;
		i=2;
		i1=i;j1=j;t1=t;k1=k;
//yy end
	}
//yy
	yuyivalue.Etyp=i;
	yuyivalue.Evalue=j;
//yy end
	return TRUE;
}

int CCompiler::r_Xiang()
{
	int i1,i2,j1,j2,t1,t2,k1,k2,i,j,t,k;
	if (!r_YingZhi()) return FALSE;
//yy
	i=yuyivalue.Etyp;
	j=yuyivalue.Evalue;
	i1=i;j1=j;
	switch (i1)
	{
	case 1:
		t1=1;k1=j1;break;
	case 2:
		t1=temptab[j1].typ;
		k1=temptab[j1].taddr;
		break;
	default :
		t1=idtab[j1].typ;
		k1=idtab[j1].addr;
	}
//yy end
	while (GetCurSym()->type==18)//*
	{
		NextSym();
		if (!r_YingZhi()) return FALSE;
//yy
		i2=yuyivalue.Etyp;
		j2=yuyivalue.Evalue;
		switch (i2)
		{
		case 1:
			t2=1;k2=j2;break;
		case 2:
			t2=temptab[j2].typ;
			k2=temptab[j2].taddr;
			break;
		default :
			t2=idtab[j2].typ;
			k2=idtab[j2].addr;
		}
		t=(t1>t2)?t1:t2;
		j=newtemp(t);
		k=temptab[j].taddr;
		if (i1==1)
			if (i2==1)
				gen("*I",1,j1,1,j2,3,k);
			else
				if (t2==1)
					gen("*I",1,j1,i2+1,k2,3,k);
				else
					gen("*R",1,j1,i2+1,k2,3,k);
		else
			if (i2==1)
				if (t1==1)
					gen("*I",i1+1,k1,1,j2,3,k);
				else
					gen("*R",i1+1,k1,1,j2,3,k);
			else
				if ((t1==1) && (t2==1))
					gen("*I",i1+1,k1,i2+1,k2,3,k);
				else
					gen("*R",i1+1,k1,i2+1,k2,3,k);
		if (i1==2) temptab[j1].used=FALSE;
		if (i2==2) temptab[j2].used=FALSE;
		i=2;
		i1=i;j1=j;t1=t;k1=k;
//yy end
	}
//yy
	yuyivalue.Etyp=i;
	yuyivalue.Evalue=j;
//yy end
	return TRUE;
}

int CCompiler::r_YingZhi()
{
	int idlevel=yuyivar.currbl;//yy
	int idpoint;//yy
	switch (GetCurSym()->type)
	{
	case 1://id
//yy
		idpoint=lookupv2(GetCurSym()->text,idlevel);
		switch (idpoint)
		{
		case -1:
			m_nErrorNum=34;
			m_nErrorAddress=m_pCurSym;
			return FALSE;
		case 0:
			m_nErrorNum=33;
			m_nErrorAddress=m_pCurSym;
			return FALSE;
		default:
			if (idlevel==yuyivar.currbl)
				if (idtab[idpoint].kind==4) yuyivalue.Etyp=4;
				else yuyivalue.Etyp=3;
			else yuyivalue.Etyp=idlevel+5;
			yuyivalue.Evalue=idpoint;
		}
//yy end
		NextSym();
		break;
	case 2://num
//yy
		yuyivalue.Etyp=1;
		yuyivalue.Evalue=GetCurSym()->value;
//yy end
		NextSym();
		break;
	case 33://(
		NextSym();
		if (!r_BiaoDaShi()) return FALSE;
		switch (GetCurSym()->type)
		{
		case 34://)
			break;
		default:
			m_nErrorNum=17;
			m_nErrorAddress=m_pCurSym;
			return FALSE;
		}
		NextSym();
		break;
	default:
		m_nErrorNum=28;
		m_nErrorAddress=m_pCurSym;
		return FALSE;
	}
	return TRUE;
}

int CCompiler::r_BuErBiaoDaShi()
{
	int t;
	int tc,fc;
	switch (GetCurSym()->type)
	{
	case 20://~
		NextSym();
		if (!r_BuErBiaoDaShi()) return FALSE;
//yy
		t=yuyivalue.TC;
		yuyivalue.TC=yuyivalue.FC;
		yuyivalue.FC=t;
//yy end
		break;
	case 33://(
	case 1://id
	case 2://num
		if (!r_GuanXiBiaoDaShi()) return FALSE;
//yy
		tc=yuyivalue.TC;
		fc=yuyivalue.FC;
//yy end
		while (GetCurSym()->type==21 || GetCurSym()->type==22)
		{
			if (GetCurSym()->type==21)//&
			{
				NextSym();
				backpatch(tc,4,2,yuyivar.nxq);//yy
				if (!r_BuErBiaoDaShi()) return FALSE;
				tc=yuyivalue.TC;//yy
				fc=merge(fc,yuyivalue.FC,4);//yy
			}
			else //|
			{
				NextSym();
				backpatch(fc,4,2,yuyivar.nxq);//yy
				if (!r_BuErBiaoDaShi()) return FALSE;
				fc=yuyivalue.FC;//yy
				tc=merge(tc,yuyivalue.TC,4);//yy
			}
		}
//yy
		yuyivalue.TC=tc;
		yuyivalue.FC=fc;
//yy end
		break;
	default:
		m_nErrorNum=29;
		m_nErrorAddress=m_pCurSym;
		return FALSE;
	}
	return TRUE;
}

int CCompiler::r_GuanXiBiaoDaShi()
{
	int i1,i2,j1,j2,t1,t2,k1,k2,rop;
	if (!r_BiaoDaShi()) return FALSE;
//yy
	i1=yuyivalue.Etyp;
	j1=yuyivalue.Evalue;
	switch (i1)
	{
	case 1:
		t1=1,k1=j1;break;
	case 2:
		t1=temptab[j1].typ;
		k1=temptab[j1].taddr;
		break;
	default:
		t1=idtab[j1].typ;
		k1=idtab[j1].addr;
	}
//yy end
	if (!r_GuanXi()) return FALSE;
	rop=yuyivalue.Code;//yy
	if (!r_BiaoDaShi()) return FALSE;
//yy
	i2=yuyivalue.Etyp;
	j2=yuyivalue.Evalue;
	switch (i2)
	{
	case 1:
		t2=1,k2=j2;break;
	case 2:
		t2=temptab[j2].typ;
		k2=temptab[j2].taddr;
		break;
	default:
		t2=idtab[j2].typ;
		k2=idtab[j2].addr;
	}
	if ((t1!=1) || (t2!=1))
	{
		m_nErrorNum=39;
		m_nErrorAddress=m_pCurSym;
		return FALSE;
	}
	yuyivalue.TC=yuyivar.nxq;
	if (i1!=1) i1++;
	if (i2!=1) i2++;
	gen(m_QuadOpCodeTable[rop],i1,k1,i2,k2,0,0);
	yuyivalue.FC=yuyivar.nxq;
	gen("j",0,0,0,0,0,0);
	if (i1==3) temptab[j1].used=FALSE;
	if (i2==3) temptab[j2].used=FALSE;
//yy end
	return TRUE;
}

int CCompiler::r_GuanXi()
{
	switch (GetCurSym()->type)
	{
	case 23://<
	case 24://<=
	case 25://>
	case 26://>=
	case 27://=
	case 28://<>
		break;
	default:
		m_nErrorNum=30;
		m_nErrorAddress=m_pCurSym;
		return FALSE;
	}
//yy
	yuyivalue.Code=GetCurSym()->type-11;
//yy end
	NextSym();
	return TRUE;
}

void CCompiler::gen(char * op,int a1,int a2,int a3,int a4,int a5,int a6)
{
	if (yuyivar.nxq>=QUAD_TABLE_LEN-1) return;
	int r=29;
	for (int i=0;i<QUAD_OPCODE_TABLE_LEN;i++)
	{
		if (!::stricmp(m_QuadOpCodeTable[i],op))
		{
			r=i;break;
		}
	}
	quad[yuyivar.nxq].op=r;
	quad[yuyivar.nxq].arg1.fl=a1;
	quad[yuyivar.nxq].arg1.flvalue=a2;
	quad[yuyivar.nxq].arg2.fl=a3;
	quad[yuyivar.nxq].arg2.flvalue=a4;
	quad[yuyivar.nxq].result.fl=a5;
	quad[yuyivar.nxq].result.flvalue=a6;
	yuyivar.nxq++;
}

void CCompiler::addid(char * name, int typ, int kind, int addr)
{
	if (yuyivar.lasent>=ID_TABLE_LEN-1) return;
	::strcpy(idtab[yuyivar.lasent].name,name);
	idtab[yuyivar.lasent].typ=typ;
	idtab[yuyivar.lasent].kind=kind;
	idtab[yuyivar.lasent].addr=addr;
	yuyivar.lasent++;
}

void CCompiler::backpatch(int link, int point, int v1, int v2)
{
	if (link==0) return;
	switch (point)
	{
	case 2:
		backpatch(quad[link].arg1.fl,point,v1,v2);
		quad[link].arg1.fl=v1;
		quad[link].arg1.flvalue=v2;
		break;
	case 3:
		backpatch(quad[link].arg2.fl,point,v1,v2);
		quad[link].arg2.fl=v1;
		quad[link].arg2.flvalue=v2;
		break;
	case 4:
		backpatch(quad[link].result.fl,point,v1,v2);
		quad[link].result.fl=v1;
		quad[link].result.flvalue=v2;
		break;
	default:
		return;
	}
}

int CCompiler::lookupv(char * idname, int idlevel)
{
	if (!::stricmp(idname,leveltab[idlevel].name)) return -1;
	int n=leveltab[idlevel].varnum+leveltab[idlevel].parnum;
	int pointer=leveltab[idlevel].pointer;
	for (int i=pointer;i<(pointer+n);i++)
		if (!::stricmp(idname,idtab[i].name)) return i;
	return 0;
}

int CCompiler::lookupp(char * id)
{
	for (int i=0;i<yuyivar.lastbl;i++)
		if (!::stricmp(id,leveltab[i].name)) return i;
	return -1;
}

int CCompiler::newtemp(int t)
{
	for (int i=leveltab[yuyivar.currbl].temp;i<yuyivar.tempp;i++)
		if ((temptab[i].used==0) && (temptab[i].typ==t))
		{
			temptab[i].used=1;
			return i;
		}
	temptab[yuyivar.tempp].used=1;
	temptab[yuyivar.tempp].typ=t;
	temptab[yuyivar.tempp].taddr=leveltab[yuyivar.currbl].recl;
	leveltab[yuyivar.currbl].recl+=t;
	leveltab[yuyivar.currbl].temp++;
	return yuyivar.tempp++;
}

int CCompiler::merge(int link1, int link2, int p)
{
	if (link1==0) return link2;
	int a=link1;
	int b;
	while (1)
	{
		switch (p)
		{
		case 2:
			b=quad[a].arg1.fl;
			break;
		case 3:
			b=quad[a].arg2.fl;
			break;
		case 4:
			b=quad[a].result.fl;
			break;
		default:
			b=0;
		}
		if (b==0)
		{
			switch (p)
			{
			case 2:
				quad[a].arg1.fl=link2;
				break;
			case 3:
				quad[a].arg2.fl=link2;
				break;
			case 4:
				quad[a].result.fl=link2;
				break;
			default :
				;
			}
			return link1;
		}
		else
		{
			a=b;
		}
	}
}

int CCompiler::lookupv2(char * name, int & level)
{
	int i=level;
	int r;
	while(1)
	{
		if (i<0) return 0;
		r=lookupv(name,i);
		switch (r)
		{
		case -1:
			level=i;
			return -1;
		case 0:
			i--;
			break;
		default:
			level=i;
			return r;
		}
	}
}

InterfaceType * CCompiler::GetTable()
{
	return &m_Interface;
}
上一页 1 2 34
💿 文件大小 1292 K
👤 上传用户 danlong
📂 所属分类编译器/解释器
🏷️ 相关标签

#Simple #分 #符号 #语言
⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -