//Fall 2011 Compiler class
//ENG-LIKE-GRAMMAR-With Actual tokens
//Complete the following predictive recursive descend parser

#include <iostream>
#include <fstream>
using namespace std;


#define Noun_ERR "..Must see a valid noun\n****Rejected****\n";
#define Verb_ERR "..Must see a valid verb\n****Rejected****\n";
#define all_ERR "..Must see all\n****Rejected****\n";
#define day_ERR "..Must see day.\n****Rejected****\n";
#define EC_ERR "..Charcters after all day..\n****Rejected****\n";

#define root     "<ENG> -> <Subject><Predicate>\n";
#define stree    "<Subject> -> <Noun><SubjectP>\n";
#define sptree1  "<SubjectP> -> and <Noun><SubjectP> || , <Noun><SubjectP>\n";
#define sptree2  "<SubjectP> -> empty\n";
#define ntree    "<Noun> -> Adam | John | Sue | Kim\n";
#define ptree    "<Predicate> -> <Verb> all day.\n";
#define vtree    "<Verb> -> cried | laughed | studied | played\n";


ifstream f1;

void gettoken(char* token)
{
   if (!f1.eof()) f1>>token; 
}

void noun(char* token)
{
	cout<<ntree;
	gettoken(token);
	if ((strcmp(token, "Adam") !=0)  &&  (strcmp(token, "John") !=0) && (strcmp(token, "Sue") !=0) && (strcmp(token, "Kim") !=0))
	{
		cout<<Noun_ERR;
		exit(0);
	}
}



void verb(char* token)
{
  	cout<<vtree;
  	if (strcmp(token, "cried") !=0  &&  strcmp(token, "laughed") !=0 && strcmp(token, "studied") !=0 && strcmp(token, "played") !=0)
	{
		cout<<Verb_ERR;
		exit(0);
	}
}

  

int main()
{
	char token[10];
	f1.open("sentence1.txt", ios::in);
	if (f1.fail())
	{
		cout<<"cannot open file!!\n";
		exit(1);
	}	
    
	cout<<root;
	
	if (f1.eof())
		cout<<"***Accepted***\n";
	else
		cout<<EC_ERR;
    	f1.close();
	return 0;
}