search
Log In

Recent questions tagged infix-expressions

0 votes
0 answers
1
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$.
asked Sep 6, 2019 in Compiler Design Lakshman Patel RJIT 50 views
To see more, click for the full list of questions or popular tags.
...