Design a context-free grammar for polynomials in . Add semantic functions to produce an attribute grammar that will store the outcome (as a string) of multiplication by in a synthesized attribute of the root of the parse tree.

Hint: Modify the attribute grammar of problem below

Write a context-free grammar for polynomials in x. Add semantic func- tions to produce an attribute grammar that will accumulate the polynomial's derivative (as a string) in a synthesized attribute of the root of the parse tree. Answer: The following assumes that exponents in the input are all positive integers. P T more-T's more ls.st.d T num T-tail T-tail x exp T-tail E D> Td := T.tail.d exp.c := T-tail,c T-taild := " " exp.d := float-to-string(exp.c num.v) + "X **" + int-to-string(num.v-1) exod := float-to-string(expC) more.TS2.st-more-Ts1.st + +" + Td more-Ts.d-more-Tsst exp E more-Ts +T more-TS2 more. Ts1.d := more-TS2.d more-Is E Write a context-free grammar for polynomials in x. Add semantic func- tions to produce an attribute grammar that will accumulate the polynomial's derivative (as a string) in a synthesized attribute of the root of the parse tree. Answer: The following assumes that exponents in the input are all positive integers. P T more-T's more ls.st.d T num T-tail T-tail x exp T-tail E D> Td := T.tail.d exp.c := T-tail,c T-taild := " " exp.d := float-to-string(exp.c num.v) + "X **" + int-to-string(num.v-1) exod := float-to-string(expC) more.TS2.st-more-Ts1.st + +" + Td more-Ts.d-more-Tsst exp E more-Ts +T more-TS2 more. Ts1.d := more-TS2.d more-Is E