5A. Write semantic rules for the grammar given which is used 3 to convert the Roman numeral to equivalent decimal value. (Use Synthesized attribute). The following context- free grammar can parse all the lowercase roman numerals from 1-99. The terminal symbols are { c, I, X, V, for ex: 43 is xliii A XBDICIC BI! C XCD DE VFF E + x v F iFe