Typos

Author: eliasdiem

ch02/2.3/2.3.md

@@ -2,7 +2,10 @@
 
 ### 2.3.1
 
-Construct a syntax-directed translation scheme that trans­ lates arithmetic expressions from infix notation into prefix notation in which an operator appears before its operands; e.g. , -xy is the prefix notation for x - y . Give annotated parse trees for the inputs 9-5+2 and 9-5*2.。
+Construct a syntax-directed translation scheme that translates arithmetic
+expressions from infix notation into prefix notation in which an operator
+appears before its operands; e.g. , -xy is the prefix notation for x - y. Give
+annotated parse trees for the inputs 9-5+2 and 9-5*2.
 
 #### answer
 
@@ -33,7 +36,9 @@ factor -> digit {print(digit)}
 
 ### 2.3.2
 
-Construct a syntax-directed translation scheme that trans­ lates arithmetic expressions from postfix notation into infix notation. Give annotated parse trees for the inputs 95-2* and 952*-.
+Construct a syntax-directed translation scheme that translates arithmetic
+expressions from postfix notation into infix notation. Give annotated parse
+trees for the inputs 95-2* and 952*-.
 
 #### answer
 
@@ -65,7 +70,8 @@ E -> {print("(")} E {print(op)} E {print(")"}} op | digit {print(digit)}
 
 ### 2.3.3
 
-Construct a syntax-directed translation scheme that trans­ lates integers into roman numerals
+Construct a syntax-directed translation scheme that translates integers into
+roman numerals.
 
 #### answer
 
@@ -157,7 +163,8 @@ digit -> smallDigit {digit.v = smallDigit.v}
 
 ### 2.3.5
 
-Construct a syntax-directed translation scheme that trans­ lates postfix arithmetic expressions into equivalent prefix arithmetic expressions.
+Construct a syntax-directed translation scheme that translates postfix
+arithmetic expressions into equivalent prefix arithmetic expressions.
 
 #### answer