The Gateway to Computer Science Excellence
0 votes
7 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$.
in Compiler Design by Veteran (54.8k points) | 7 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,648 questions
56,429 answers
195,205 comments
99,905 users