In this project, you are expected to write a tool for eliminating left recursion from any given BNF grammar. A grammar, which is free from any left recursion, is suitable for top-down parser implementations. Your program should expect any input BNF grammar in the following example text file format -> a -> b Here, nonterminals are represented by uppercase letters written between "e" and "> symbols. Terminals are represented by lowercase letters. Each row indicates a single rule of the BNF grammar. Each rule consists of three parts: 1) left-hand side (LHS), which consists of a single nonterminal symbol, 2) rule operator, which is represented by consecutive "-" and ">" operators, and, finally, 3) right-hand side (RHS), which consists of a mixture of nonterminal and terminal symbols, each separated by whitespace tokens. Whitespace can contain a mixture of space and tab characters. You are expected to implement a very simple grammar transformation algorithm. The algorithm is given as follows. for each rule i in the grammar do if i is not left recursive then copy rule i to the output else apply left recursion elimination on i fi done