You must modify the syntactic analyzer to detect and recover from additional syntax errors using…

You must rewrite the grammar to eliminate the EBNF brace and bracket metasymbols and to
incorporate the significance of parentheses, operator precedence and associativity for all
operators. Among arithmetic operators the exponentiation operator has highest precedence
following by the multiplying operators and then the adding operators. All relational operators
have the same precedence. Among the binary logical operators, and has higher precedence than
or. Of the categories of operators, the unary logical operator has highest precedence, the
arithmetic operators have next highest precedence, followed by the relational operators and
finally the binary logical operators. All operators except the exponentiation operator are left
associative. The directives to specify precedence and associativity, such as %prec and %left,
may not be used
Your parser should be able to correctly parse any syntactically correct program without any
problem.
You must modify the syntactic analyzer to detect and recover from additional syntax errors using
the semicolon as the synchronization token. To accomplish detecting additional errors an error
production must be added to the function header and another to the variable declaration.
Your bison input file should not produce any shift/reduce or reduce/reduce errors. Eliminating
them can be difficult so the best strategy is not introduce any. That is best achieved by making
small incremental additions to the grammar and ensuring that no addition introduces any such
errors.

“Get 15% discount on your first 3 orders with us”
Use the following coupon
FIRST15

Order Now