A Translation Scheme Example A simple translation scheme that converts infix expressions to the corresponding postfix expressions. E→TR R→+T{print((+")}R1 R→E T-id print(id.name)} a+b+c>ab+c+ infix expression postfix expression CS308 Compiler Theory 7A Translation Scheme Example • A simple translation scheme that converts infix expressions to the correspondi fi i ding postfix express ions. E → T R R → + T { print(“+”) } R1 R → ε T → id { print(id.name) } a+b+c Î ab+c+ infix expression postfix expression CS308 Compiler Theory 7