Compilation Principle -- C language implementation of prediction table

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
/*  Guangxi Normal University   School of computer science and engineering  GuangXi Normal University College of Computer Science and Engineering Student STZ */ 

string map[6][7]={
    
	{
     "",  "i",  "+",  "*",  "(",")","#"}, 
	{
    "E", "TD",   "",   "", "TD", "", ""},
	{
    "D",   "","+TD",   "",   "","e","e"},
	{
    "T", "FS",   "",   "", "FS", "", ""},
	{
    "S",   "",  "e","*FS",   "","e","e"},
	{
    "F",  "i",   "",   "","(E)", "", ""},
};

char input[] = "i+i*i#";
char start[] = "#E";


void match(int l,int c){
    
// int len = map[l][c].length();// The length of the replacement string  
	int i = 0;
	int isfirst = 0;
	cout<<start[strlen(start)-1]<<"->"<<map[l][c]<<endl;
	for(string::reverse_iterator iter=map[l][c].rbegin();iter!=map[l][c].rend();iter++){
    // Reverse iteration  
		if(isfirst==0){
    
			start[strlen(start)-1] = *iter;
			isfirst=1;
		}else{
    
			start[strlen(start)] = *iter;
		}
		for(int j=0;j<6;j++){
    
			printf("%c",start[j]);
		}cout<<endl;
}

int analysis(char l,char c){
    
	int flag = 1; 
	int i,j;
	string L = "";
	L += l;
	string C = "";
	C +=c;
	//cout<<l<<endl;
	for(i=1;i<6;++i){
     
		if(L.compare(map[i][0])==0){
    // Match to line  
			break; 
		} 
	}	
// cout<<i<<endl; 
// i--;
	for(j=1;j<7;++j){
    
		if(C.compare(map[0][j])==0){
    // Match to column 
			break; 
		}
	}	
// cout<<j<<endl; 
// j--;
	if(map[0][j].compare("")!=0){
    
		match(i,j);// 
		return 1;
		}else{
    
			cout<<l<<" Mismatch "<<map[0][j]<<" map by ："<<map[i][j]<<endl; 
			return 0;
		}
}

int main(){
    
	 		int flag = 1;	
			while(flag){
    
				cout<<endl<<" At present start state ：";
					for(int j=0;j<6;j++){
    
						printf("%c",start[j]);
					}cout<<endl;
				cout<<" At present input state ："<<input<<endl; 
				if(start[strlen(start)-1] == input[0]){
    // If the tail of the stack is the same as the head of the remaining string, eliminate it first ;
					start[strlen(start)-1]='\0';
					for(int i=0;i<strlen(input)-1;i++){
    
						input[i] = input[i+1];
					}
					input[strlen(input)-1]='\0';
					cout<<endl<<" Elimination success ！\n At present start state ："<<start<<"\n At present input state ："<<input<<endl; 
				}
				else if(start[strlen(start)-1]=='e'){
    // If the last one is empty , Automatically remove  
					start[strlen(start)-1]='\0';
				}
				else
					flag = analysis(start[strlen(start)-1],input[0]);// If the tail of the stack is different from the head of the remaining string ;
				if(flag==0){
    
					cout<<" Compilation error ！！"<<endl; 
					break;
				}
				if(strlen(input)==0){
    
					cout<<"END！！"<<endl; 
					break;
				}
			} 
	return 0;
}