yacc and lex

ASSUMPTIONS AND CONSTRAINTS FOR THE PROJECT You can assume that the nonterminals start with a single uppercase letter following any alphabetical characters in the input grammar. Such as , . etc... In your project, you should consider three cases for grammar inputs. a) The first one simply includes grammar rules which do not need left recursion. b) In the second one, there will be a combination of non-terminals with only one left recursion. c) In the third, you should consider the case with multiple lines of rules which can have one left recursion in each. Output Format For the Project The output of the project should satisfy the properties below strictly: 1. There must be 1 space character between each nonterminal, terminal and symbol. 2. The order of rules should not change Input Output Sa Y 3. The created new nonterminal "E2 and their branches should come after the nonterminal e where E is the nonterminal that E2 is produced from Input Output ->-- 4E-> X- E1T5 xE2> epsilon 2 -T> - b