bianyi.h

来自「编译原理课程实验要求做的语法分析」· C头文件 代码 · 共 47 行

void youbu(int Ruleright[52][7],int Link[34][8]);
#include<iostream.h>
#include<malloc.h>
#include<ctype.h>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include <cstdlib>
typedef struct{
	int Ltrace;
	int Lptr;
}SElemType;

typedef struct{
	SElemType *base;
	SElemType *top;
	int stacksize;
}SqStack;
struct EElemType{
	int Mark;
	int Line;
	int arrange;
	int kind;
	struct EElemType *next;
 };
struct Word                    //结果数组中具体的模式
{
	int Ltrace;
	struct Word *next;
	int row;
	int arrage;
};


int Rpop(int &Ltrace,int &Lptr,SqStack &Sqstack);
void Rpush(int Ltrace,int Lptr,SqStack &Sqstack);
void InitStack(SqStack &Sqstack);
void Destroystack(SqStack &Sqstack);
int Rempty(SqStack Sqstack);
void Epop(SqStack &Sqstack);
void Rtrail(SqStack &Sqstack,int Fiptr,bool Follow[][36]);
void Rfirst(bool First[][36],const int Ruleright[][7],const int Link[][8]);
void RFollow(bool Follow[][36], const int Link[][8], const int Ruleright[][7], const bool First[][36]);
void Ryuce(const bool Follow[][36], const int Link[][8], const int Ruleright[][7], const bool First[][36],int Forecast[][36]);
struct Word *getsym();
void yufa(const int Forecast[][36],struct Word *Hptr,const int Ruleright[][7]);