package comp;
 
import java.io.* ;
public class SyntaxAnalyser
{
  String file;
  Token nextSymbol;
 
  public SyntaxAnalyser(String fileName) {
    file = fileName;
  }
 
  public void parse() throws IOException {
 
    LexicalAnalyser lex = new LexicalAnalyser(file);
    Token t = null ;
              do
                  {
                  t = lex.getNextToken() ;
                  System.out.println(t) ;
                  }
              while (t.symbol != Token.eofSymbol) ;
 
 
  //define a set of all terminals/non-terminals which could be the left most token of (a). FIRST(a)
    //variable nextSymbol to recognise the next token from the lexical analyser
 
    //acceptTerminal Method
    if(lex.getNextToken() != null)
    {
      Token nextSymbol = lex.getNextToken();
    }
    else
    {
      System.out.println("There has been an Error with nextSymbol");
    }
  }
 
    //<program> ::= <procedure list>
    public void program()
    {
 
      if(nextSymbol.toString() == "<program>")
      {
      }
 
    }
    private void procedureList() {
      //call .procedureDefinition(); or .procedureList();.procedureDefinition()
    }
    //Second method to elimintate left recursion
    private void procedureList2(){
 
    }
    private void procedureDefinition() {
      //call procedureDefinition
    }
    private void procedureHeading() {
    }
    private void declerationList() {
    }
    //Second method to eliminate left recursion
    private void declerationList2(){
 
    }
    private void declaration() {
    }
    private void identifierList() {
    }
    //Second method to eliminate left recursion
    private void identifierList2()
    {
 
    }
    private void block() {
    }
    private void statementPart() {
    }
    private void statementList() {
    }
    private void statement() {
    }
    private void assignmentStatement() {
    }
    private void ifStatement() {
    }
    private void whileStatement() {
    }
    private void procedureStatement() {
    }
    private void untilStatement() {
    }
    private void argumtList() {
    }
    //Second method to eliminate left recursion
    private void argumetList(){
 
    }
    private void condtion() {
    }
    private void conditionOperator() {
      //if(op == '+' || op == '-' || op == '*' || op == '/')
      {
        //.getNextChar();
      }
    }
    private void expression() {
    }
    private void term() {
    }
    private void factor()
    {
    }
}