Recursive Descent parser program - Compiler Design

Code pinned in comnent section

[@durgabhavanislectureshub3674]

#include
#include
int E();
int F();
void match(char);
int a=0;
char input[100];
int main() {
scanf("%s",input);
E();
if(input[a]=='$')
printf("Successfully parsed
");
else
printf("Error
");
}
int E()
{
if(input[0]=='i')
{
match('i');
F();
return(0);
}
}
int F()
{
if(input[a]=='+') {
match('+');
}
if(input[a]=='i') {
match('i');
}
else {
return(0);
}
F();
}
void match(char t)
{
if(input[a]==t) {
printf("%c matched
",t);
a++;
}
else {
printf("Error");
exit(0);
}
}