The following problem list the operators line by line, where each line is a higher precedence than the operators underneath.
Given Expressions:( postfix ) ++, ( postfix ) –++ ( prefix ), — ( prefix )*, >= , &+ , – , – ( unary ) , + ( unary ) , %> , &&, /, !||, ˜| ( this symbol meant to be a tilde followed by a pipe )=, /=
part a) Solve the problems for the above expressions and show your work for the values ( assume 5 bits are used, two’s compliment notation, ~ | and & represents the logical bitwise XOR and AND operations respectively, ! Represents boolean NOT , and there is implicit type conversion between BOOLEANS and INTEGERS )A = 5B = 7C = 11D = -13E = -2
part b)Write a formally defined CFG for the given expressionand assume and imply that:1) only variables can have the increment or decrement operation;2) ~ | and & represents the logical bitwise XOR and AND operations respectively,3) ! Represents boolean NOT
part c)Rewrite each expression from the expression as function calls as if it where an object oriented programming language ( like how is practically done in Ruby )? Is there a need to express this using a symbol to break precedence? Why or why not?Then, write RDA for this.