Java project writing a parser using BYACC/J for simple language

1) Rewrite the grammar to eliminate any ambiguity and make sure that the associativity of the operations + , – , *, and /are left to right. However, the associativity of the power operation ^ is from right to left.
2) Write a parser of the rewritten grammar using BYACC/J. Once you have built your parser, you should be able to process programs written in the language described above. When BYACC finds input that doesn't match the grammar, it automatically terminates with the message 'Syntax error'. You will need to write an error routine (yyerror) that also prints out the line number before this termination, and a main method that read a program from a file.