rec_parse.cpp

编译原理LL（1）语法分析 从文法开始,一直做到了符号表的实现

#include "stdafx.h"
#include "Rec_Parse.h"

//整个思想和LL1驱动器一样,把压栈改成调用,把弹栈改成返回.
//把查找LL1分析表改成查找PREDICT集(其实改不改都一样.)
void Rec_Parse::Parse(symbol X)
{
	terminal a;
	int pnum;
	vector<symbol>::reverse_iterator v_it;


	a=pos->value;

	if( g->is_nonterminal(X) )
	{
		if(a.first == Id || a.first == Intc) a=make_pair(a.first,-1);
		for (pnum=0; pnum < Predict.size(); pnum++) //查找PREDICT集
		{
			if( (g->productions[pnum].lhs == X) && ( Predict[pnum].find(a) != Predict[pnum].end() ) )
			{
				cout<<"Production "<<pnum+1<<endl;
				for (int n=0; n < g->productions[pnum].rhs.size(); n++)
					Parse(g->productions[pnum].rhs[n]); //递归调用点.
				return;
			}
			else
			{
				if ( pnum == Predict.size() - 1 ) error(pos,X);
				else continue;
			}
		}
	}
	else if (g->is_terminal(X) && (g->match(X,a) || X.first == $) )
	{
		token_pos = pos;
		if (X.first != $)
		{
			cout<<"Match: "<<g->GetStr(X)<<" , "<<g->GetStr(a)<<endl;
			pos++;
		}
		
		return;
	}
	else if ( g->is_action_symbol(X) )
	{
		cout<<"Call: "<<g->GetStr(X)<<endl;
		//Call Semantic Routine corresponding to X;
		act.call_action(X,token_pos);
		return;
	}
	else error(pos,X);
}

//出错处理和LL1驱动器是一样的.
void Rec_Parse::error(list<TOKEN>::iterator pos,nonterminal X)
{
	if(pos == tlist->end())
		cerr<<"Maybe lose "<<g->GetStr(X)<<endl;
	else 
		cerr<<"There's an error here: ("<<pos->line<<") "<<g->GetStr(pos->value)<<' '<<g->GetStr(X)<<endl;
	exit(1);
}