递归子程序

#include<bits/stdc++.h>
using namespace std;
#define J G
string s;
int N=0;
int cur =0;
void E();
void T();
void G();
void F();
void S();

int main(){
    cin>>s;
    if(s[cur]!='i'&&s[cur]!='('){
        cout<<"error"<<endl;
        exit(0);
       }
    E();
    if(s[cur]=='#')
        cout<<"accept"<<endl;
    else
        cout<<"error"<<endl;

}
void E(){
    cout<<N<<" E-->TJ"<<endl;
    N++;
    T();
    G();
}
void T(){
    cout<<N<<" T-->FS"<<endl;
    N++;
    F();
    S();
}
void G(){
    if(s[cur]=='+')
    {
         cout<<N<<" G-->+TJ"<<endl;
         N++;
         cur++;
         T();
         G();
    }
    else
    {
        cout<<N<<" G-->&"<<endl;
        N++;
    }
}
void F(){
    if(s[cur]=='(')
    {
        cout<<N<<" F-->(E)"<<endl;
        N++;
        cur++;
        E();
        if(s[cur]==')'){
            cur++;
        }
        else
        {
            cout<<"error"<<endl;
            exit(0);
        }
    }
    else if(s[cur]=='i'){
        cout<<N<<" F-->i"<<endl;
        N++;
        cur++;
    }
//        else if(s[cur]=='i'){
//        cout<<N<<" F-->i"<<endl;
//        N++;
//        cur++;
//    }

}
void S(){
    if(s[cur]=='*'){
        cout<<N<<" S-->*FS"<<endl;
        N++;
        cur++;
        F();
        S();
    }
    else{
        cout<<N<<" S-->&"<<endl;
        N++;
    }
}