12. Use the following SDT to convert an infix expression (9*3+2) to it post-fix equivalent. Semantic...
12. Use the following SDT to convert an infix expression (9*3+2) to it post-fix equivalent. Semantic rules Production (print(")) ) (priot ()) () (print (num.lval)) E E+T T TP- [5 marks F num 13. Briefly explain the relevance of DAG and TAC at the Intermediate code generation phase. Give an example of DAG(Directed Acyclic Graph) with its equivalent TAC(Three-Address Code). [6 marks 14. Parser table is very important in predictive parsing; construct a parser table for the following CFG: S -ACB | CbB Ba A da BC B-gle C-he [10 marks] 15. Bring up a question and it's equivalent solution from the topics we've covered so far. [4 marks Note: no similar question to the ones presented here)
12. Use the following SDT to convert an infix expression (9*3+2) to it post-fix equivalent. Semantic rules Production (print(")) ) (priot ()) () (print (num.lval)) E E+T T TP- [5 marks F num 13. Briefly explain the relevance of DAG and TAC at the Intermediate code generation phase. Give an example of DAG(Directed Acyclic Graph) with its equivalent TAC(Three-Address Code). [6 marks 14. Parser table is very important in predictive parsing; construct a parser table for the following CFG: S -ACB | CbB Ba A da BC B-gle C-he [10 marks] 15. Bring up a question and it's equivalent solution from the topics we've covered so far. [4 marks Note: no similar question to the ones presented here)