11 views
Give an SDD to translate infix expressions with $+$ and $\ast$ into equivalent expressions without redundant parentheses. For example, since both operators associate from the left, and $\ast$ takes precedence over  $+, ((a\ast(b+c))\ast(d))$ translates into $a\ast(b + c)\ast d$.
| 11 views

1
+1 vote