clarify instructions

[lambda.git] / exercises / _assignment2_answers.mdwn

diff --git a/exercises/_assignment2_answers.mdwn b/exercises/_assignment2_answers.mdwn
index bb3b724..3eaaa15 100644 (file)
--- a/exercises/_assignment2_answers.mdwn
+++ b/exercises/_assignment2_answers.mdwn
@@ -1,7 +1,9 @@
 Syntax
 ------
 
-Insert all the implicit `( )`s and <code>&lambda;</code>s into the following abbreviated expressions.
+Insert all the implicit `( )`s and <code>&lambda;</code>s into the following abbreviated expressions. Don't just insert them *freely*; rather, provide the official expression, without any notational shortcuts, that is syntactically identical to the form presented.
+
+*In response to your feedback and questions, we refined the explanation of the conventions governing the use of the `.` shorthand. Thanks!*
 
 1.  `x x (x x x) x`  
      <code><b>(((</b>x x<b>)</b> (<b>(</b>x x<b>)</b> x)<b>)</b> x<b>)</b></code>
@@ -53,11 +55,11 @@ In Racket, these functions can be defined like this:
 
 15. Define a `neg` operator that negates `true` and `false`.
 
-    Expected behavior: 
+    Expected behavior:
 
         (((neg true) 10) 20)
 
-    evaluates to `20`, and 
+    evaluates to `20`, and
 
         (((neg false) 10) 20)