3 files changed, 25 insertions, 25 deletions
diff --git a/docs/examples/parsing/lambda/Main.scala b/docs/examples/parsing/lambda/Main.scala
index 81a175de77..165e82b670 100644
--- a/docs/examples/parsing/lambda/Main.scala
+++ b/docs/examples/parsing/lambda/Main.scala
@@ -27,8 +27,8 @@ object Main extends Application with TestParser
       {
         Console.println("Term: \n"+term)
       }
-      case Failure(msg, remainder) => Console.println("Failure: "+msg+"\n"+"Remainder: \n"+remainder.pos.longString)
-      case Error(msg, remainder) => Console.println("Error: "+msg+"\n"+"Remainder: \n"+remainder.pos.longString)
+      case Failure(msg, remainder) => Console.println("Failure: "+msg+"\n"+"Remainder: \n"+remainder.pos.longString) 
+      case Error(msg, remainder) => Console.println("Error: "+msg+"\n"+"Remainder: \n"+remainder.pos.longString) 
     }
   }
 }
diff --git a/docs/examples/parsing/lambda/TestParser.scala b/docs/examples/parsing/lambda/TestParser.scala
index 623b597337..d26589da1b 100644
--- a/docs/examples/parsing/lambda/TestParser.scala
+++ b/docs/examples/parsing/lambda/TestParser.scala
@@ -17,9 +17,9 @@ trait TestParser extends StdTokenParsers  with ImplicitConversions with TestSynt
   lexical.reserved ++= List("unit", "let", "in", "if", "then", "else")
   lexical.delimiters ++= List("=>", "->", "==", "(", ")", "=", "\\", "+", "-", "*", "/")
 
-
+  
 	def name : Parser[Name] = ident ^^ Name
-
+  
   // meaning of the arguments to the closure during subsequent iterations
   // (...(expr2 op1 expr1) ... op1 expr1)
   //      ^a^^^ ^o^ ^b^^^
@@ -29,10 +29,10 @@ trait TestParser extends StdTokenParsers  with ImplicitConversions with TestSynt
 
   def expr2 : Parser[Term] =
    chainl1(expr3, expr2, op2 ^^ {o => (a: Term, b: Term) => App(App(o, a), b)})
-
+  
   def expr3 : Parser[Term] =
    chainl1(expr4, expr3, op3 ^^ {o => (a: Term, b: Term) => App(App(o, a), b)})
-
+  
   def expr4 : Parser[Term] =
   ( "\\" ~> lambdas
   | ("let" ~> name) ~ ("=" ~> expr1) ~ ("in" ~> expr1) ^^ flatten3(Let)
@@ -42,27 +42,27 @@ trait TestParser extends StdTokenParsers  with ImplicitConversions with TestSynt
 
   def lambdas : Parser[Term] =
     name ~ ("->" ~> expr1 | lambdas) ^^ flatten2(Lam)
-
+      
   def aexpr : Parser[Term] =
   ( numericLit ^^ (_.toInt) ^^ Lit
   | name ^^ Ref
   | "unit" ^^^ Unit()
   | "(" ~> expr1 <~ ")"
   )
-
+  
   def op1 : Parser[Term] =
     "=="  ^^^ Ref(Name("=="))
-
+  
   def op2 : Parser[Term] =
   ( "+" ^^^ Ref(Name("+"))
   | "-" ^^^ Ref(Name("-"))
   )
-
+  
   def op3 : Parser[Term] =
   ( "*" ^^^ Ref(Name("*"))
   | "/" ^^^ Ref(Name("/"))
   )
-
+  
   def parse(r: Reader[char]) : ParseResult[Term] =
     phrase(expr1)(new lexical.Scanner(r))
 }
diff --git a/docs/examples/parsing/lambda/TestSyntax.scala b/docs/examples/parsing/lambda/TestSyntax.scala
index 531ae4bd54..7edca6ccdc 100644
--- a/docs/examples/parsing/lambda/TestSyntax.scala
+++ b/docs/examples/parsing/lambda/TestSyntax.scala
@@ -5,25 +5,25 @@ package examples.parsing.lambda
  *
  * @author Miles Sabin (adapted slightly by Adriaan Moors)
  */
-trait TestSyntax
+trait TestSyntax 
 {
-  trait Term
-
+  trait Term 
+  
   case class Unit extends Term
   {
     override def toString = "unit"
   }
-
+  
   case class Lit(n: int) extends Term
   {
     override def toString = n.toString
   }
-
+  
   case class Bool(b: boolean) extends Term
   {
     override def toString = b.toString
   }
-
+  
   case class Name(name: String) extends Term
   {
     override def toString = name
@@ -33,27 +33,27 @@ trait TestSyntax
   {
     def value = n
   }
-
+  
   case class Lam(n: Name, l: Term) extends Term
   {
     override def toString = "(\\ "+n+" -> "+l+")"
-  }
-
+  } 
+  
   case class App(t1: Term, t2: Term) extends Term
   {
     override def toString = "("+t1+" "+t2+")"
-  }
-
+  } 
+  
   case class Let(n: Name, t1: Term, t2: Term) extends Term
   {
     override def toString = "let "+n+" = "+t1+" in "+t2
   }
-
+  
   case class If(c: Term, t1: Term, t2: Term) extends Term
   {
     override def toString = "if "+c+" then "+t1+" else "+t2
   }
-
+  
   trait PrimTerm extends Term
   {
     def apply(n: Lit) : Term
@@ -68,7 +68,7 @@ trait TestSyntax
   {
     def apply(x: Lit) = new PrimTerm { def apply(y: Lit) = Lit(x.n-y.n) }
   }
-
+  
   case class PrimMultiply extends PrimTerm
   {
     def apply(x: Lit) = new PrimTerm { def apply(y: Lit) = Lit(x.n*y.n) }