Index: translator/Tuples/AssignExpand.cc
===================================================================
--- translator/Tuples/AssignExpand.cc	(revision 51587aa493cba4720a447024fed1e9d94b78524a)
+++ translator/Tuples/AssignExpand.cc	(revision a08ba927e920255639a48d814cce47347723392a)
@@ -38,5 +38,5 @@
 
 		CompoundStmt *newSt = 0;
-		if (! extra.empty() ) {
+		if ( ! extra.empty() ) {
 			if ( ! newSt )
 				newSt= new CompoundStmt(std::list<Label>());
@@ -69,5 +69,5 @@
 		   if ( tupleExpr->get_type() == SolvedTupleExpr::MASS ) {
 		   // extract lhs of assignments, assert that rhs is the same, create temporaries
-		   assert (! exprs.empty());
+		   assert ( ! exprs.empty());
 		   ApplicationExpr *ap1 = dynamic_cast< ApplicationExpr * >( exprs.front() );
 		   std::list<Expression *> &args = ap1->get_args();
Index: translator/Tuples/MultRet.h
===================================================================
--- translator/Tuples/MultRet.h	(revision 51587aa493cba4720a447024fed1e9d94b78524a)
+++ translator/Tuples/MultRet.h	(revision a08ba927e920255639a48d814cce47347723392a)
@@ -37,5 +37,5 @@
 		CompoundStmt *getVars() const { return newVars; }
 
-		bool hasResults() const { return (! results.empty()); }
+		bool hasResults() const { return ( ! results.empty()); }
 		std::list<Expression *> &get_results() { return results; }
 	  private:
Index: translator/Tuples/TupleAssignment.cc
===================================================================
--- translator/Tuples/TupleAssignment.cc	(revision 51587aa493cba4720a447024fed1e9d94b78524a)
+++ translator/Tuples/TupleAssignment.cc	(revision a08ba927e920255639a48d814cce47347723392a)
@@ -64,5 +64,5 @@
 
 		std::list< Expression * > new_assigns;
-		if (! matcher->match(new_assigns) )
+		if ( ! matcher->match(new_assigns) )
 			return false;
 
@@ -171,5 +171,5 @@
 						if ( best.size() == 1 ) {
 							std::list<Expression *> solved_assigns;
-							for ( ResolvExpr::AltList::iterator i = best.front().begin(); i != best.front().end(); ++i ){
+							for ( ResolvExpr::AltList::iterator i = best.front().begin(); i != best.front().end(); ++i ) {
 								solved_assigns.push_back( i->expr );
 							}
@@ -178,5 +178,5 @@
 						}
 					} else {
-						assert(! optMass.empty() );
+						assert( ! optMass.empty() );
 						ResolvExpr::AltList winners;
 						for ( std::vector< ResolvExpr::AltList >::iterator i = optMass.begin(); i != optMass.end(); ++i )
@@ -377,5 +377,5 @@
 
 	template< class InputIterator, class OutputIterator >
-	void TupleAssignSpotter::Options::lift_intersection( InputIterator begin, InputIterator end, OutputIterator out ){
+	void TupleAssignSpotter::Options::lift_intersection( InputIterator begin, InputIterator end, OutputIterator out ) {
 		if ( begin == end ) return;
 		InputIterator test = begin;
