Index: translator/Parser/DeclarationNode.cc
===================================================================
--- translator/Parser/DeclarationNode.cc	(revision b87a5edee8b2aa6c36e184150ebd60baf4c64251)
+++ translator/Parser/DeclarationNode.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
@@ -531,5 +531,5 @@
 		TypeData *prevBase = type;
 		TypeData *curBase = type->base;
-		while( curBase != 0 ) {
+		while ( curBase != 0 ) {
 			prevBase = curBase;
 			curBase = curBase->base;
@@ -591,5 +591,5 @@
 	assert( a );
 	TypeData *cur = a;
-	while( cur->base ) {
+	while ( cur->base ) {
 		cur = cur->base;
 	}
@@ -660,5 +660,5 @@
 	DeclarationNode *newnode = new DeclarationNode;
 	TypeData *srcType = type;
-	while( srcType->base ) {
+	while ( srcType->base ) {
 		srcType = srcType->base;
 	}
@@ -686,5 +686,5 @@
 		if ( type ) {
 			TypeData *srcType = type;
-			while( srcType->base ) {
+			while ( srcType->base ) {
 				srcType = srcType->base;
 			}
@@ -763,5 +763,5 @@
 	std::back_insert_iterator< std::list< Declaration* > > out( outputList );
 	const DeclarationNode *cur = firstNode;
-	while( cur ) {
+	while ( cur ) {
 		try {
 			if ( DeclarationNode *extr = cur->extractAggregate() ) {
@@ -790,5 +790,5 @@
 	std::back_insert_iterator< std::list< DeclarationWithType* > > out( outputList );
 	const DeclarationNode *cur = firstNode;
-	while( cur ) {
+	while ( cur ) {
 		try {
 ///       if ( DeclarationNode *extr = cur->extractAggregate() ) {
@@ -827,5 +827,5 @@
 	std::back_insert_iterator< std::list< Type* > > out( outputList );
 	const DeclarationNode *cur = firstNode;
-	while( cur ) {
+	while ( cur ) {
 		try {
 			*out++ = cur->buildType();
Index: translator/Parser/ExpressionNode.cc
===================================================================
--- translator/Parser/ExpressionNode.cc	(revision b87a5edee8b2aa6c36e184150ebd60baf4c64251)
+++ translator/Parser/ExpressionNode.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
@@ -120,5 +120,5 @@
 			int i = str.length() - 1;
 
-			while ( i >= 0 && !isxdigit( c = str.at( i--)) )
+			while ( i >= 0 && ! isxdigit( c = str.at( i--)) )
 				sfx += c;
 
@@ -371,5 +371,5 @@
 		  case OperatorNode::OrAssn:
 			// the rewrite rules for these expressions specify that the first argument has its address taken
-			assert( !args.empty() );
+			assert( ! args.empty() );
 			args.front() = new AddressExpr( args.front() );
 			break;
@@ -490,5 +490,5 @@
 				VarRefNode *var = dynamic_cast<VarRefNode *>( get_args());
 				assert( var );
-				if ( !get_args()->get_link() ) {
+				if ( ! get_args()->get_link() ) {
 					return new AttrExpr( var->build(), ( Expression*)0);
 				} else if ( TypeValueNode * arg = dynamic_cast<TypeValueNode *>( get_args()->get_link()) ) {
Index: translator/Parser/InitializerNode.cc
===================================================================
--- translator/Parser/InitializerNode.cc	(revision b87a5edee8b2aa6c36e184150ebd60baf4c64251)
+++ translator/Parser/InitializerNode.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
@@ -56,5 +56,5 @@
 			os << "designated by: (";
 			ExpressionNode *curdes = designator;
-			while( curdes != 0) {
+			while ( curdes != 0) {
 				curdes->printOneLine(os);
 				curdes = (ExpressionNode *)(curdes->get_link());
Index: translator/Parser/ParseNode.cc
===================================================================
--- translator/Parser/ParseNode.cc	(revision b87a5edee8b2aa6c36e184150ebd60baf4c64251)
+++ translator/Parser/ParseNode.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
@@ -50,5 +50,5 @@
     ParseNode *current = this;
 
-    while( current->get_link() != 0 )
+    while ( current->get_link() != 0 )
 	current = current->get_link();
 
Index: translator/Parser/ParseNode.h
===================================================================
--- translator/Parser/ParseNode.h	(revision b87a5edee8b2aa6c36e184150ebd60baf4c64251)
+++ translator/Parser/ParseNode.h	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
@@ -493,5 +493,5 @@
 		cur = dynamic_cast< NodeType *>( cur->get_link() );
 	} // while
-	if ( !errors.isEmpty() ) {
+	if ( ! errors.isEmpty() ) {
 		throw errors;
 	} // if
Index: translator/Parser/StatementNode.cc
===================================================================
--- translator/Parser/StatementNode.cc	(revision b87a5edee8b2aa6c36e184150ebd60baf4c64251)
+++ translator/Parser/StatementNode.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
@@ -171,14 +171,14 @@
 void StatementNode::print( std::ostream &os, int indent ) const {
 	if ( labels != 0 )
-		if (!labels->empty()) {
+		if (! labels->empty()) {
 			std::list<std::string>::const_iterator i;
 
 			os << '\r' << string( indent, ' ');
-			for( i = labels->begin(); i != labels->end(); i++ )
+			for ( i = labels->begin(); i != labels->end(); i++ )
 				os << *i << ":";
 			os << endl;
 		}
 
-	switch( type ) {
+	switch ( type ) {
 	  case Decl:
 		decl->print( os, indent );
@@ -232,5 +232,5 @@
 	buildList<Statement, StatementNode>( get_block(), branches );
 
-	switch( type ) {
+	switch ( type ) {
 	  case Decl:
 		return new DeclStmt( labs, maybeBuild< Declaration >( decl ) );
@@ -251,5 +251,5 @@
 			thenb = branches.front();
 			branches.pop_front();
-			if ( !branches.empty() ) {
+			if ( ! branches.empty() ) {
 				elseb = branches.front();
 				branches.pop_front();
Index: translator/Parser/TypeData.cc
===================================================================
--- translator/Parser/TypeData.cc	(revision b87a5edee8b2aa6c36e184150ebd60baf4c64251)
+++ translator/Parser/TypeData.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
@@ -405,5 +405,5 @@
 	switch ( kind ) {
 	  case Aggregate:
-		if ( !toplevel && aggregate->members ) {
+		if ( ! toplevel && aggregate->members ) {
 			ret = clone();
 			ret->qualifiers.clear();
@@ -411,5 +411,5 @@
 		break;
 	  case Enum:
-		if ( !toplevel && enumeration->constants ) {
+		if ( ! toplevel && enumeration->constants ) {
 			ret = clone();
 			ret->qualifiers.clear();
@@ -556,8 +556,8 @@
 
 	for ( std::list< DeclarationNode::BasicType >::const_iterator i = basic->typeSpec.begin(); i != basic->typeSpec.end(); ++i ) {
-		if ( !init ) {
+		if ( ! init ) {
 			init = true;
 			if ( *i == DeclarationNode::Void ) {
-				if ( basic->typeSpec.size() != 1 || !basic->modifiers.empty() ) {
+				if ( basic->typeSpec.size() != 1 || ! basic->modifiers.empty() ) {
 					throw SemanticError( "invalid type specifier \"void\" in type: ", this );
 				} else {
@@ -635,5 +635,5 @@
 		switch ( *i ) {
 		  case DeclarationNode::Long:
-			if ( !init ) {
+			if ( ! init ) {
 				init = true;
 				ret = BasicType::LongSignedInt;
@@ -667,5 +667,5 @@
 			break;
 		  case DeclarationNode::Short:
-			if ( !init ) {
+			if ( ! init ) {
 				init = true;
 				ret = BasicType::ShortSignedInt;
@@ -684,5 +684,5 @@
 			break;
 		  case DeclarationNode::Signed:
-			if ( !init ) {
+			if ( ! init ) {
 				init = true;
 				ret = BasicType::SignedInt;
@@ -709,5 +709,5 @@
 			break;
 		  case DeclarationNode::Unsigned:
-			if ( !init ) {
+			if ( ! init ) {
 				init = true;
 				ret = BasicType::UnsignedInt;
@@ -744,5 +744,5 @@
 
 	BasicType *bt;
-	if ( !init ) {
+	if ( ! init ) {
 		bt = new BasicType( buildQualifiers(), BasicType::SignedInt );
 	} else {
@@ -781,5 +781,5 @@
 	assert( kind == Function );
 	bool hasEllipsis = function->params ? function->params->get_hasEllipsis() : true;
-	if ( !function->params ) hasEllipsis = !function->newStyle;
+	if ( ! function->params ) hasEllipsis = ! function->newStyle;
 	FunctionType *ft = new FunctionType( buildQualifiers(), hasEllipsis );
 	buildList( function->params, ft->get_parameters() );
Index: translator/Parser/TypedefTable.cc
===================================================================
--- translator/Parser/TypedefTable.cc	(revision b87a5edee8b2aa6c36e184150ebd60baf4c64251)
+++ translator/Parser/TypedefTable.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
@@ -64,5 +64,5 @@
 		} else {
 			list<Entry>::iterator listPos = (*curPos ).second.begin();
-			while( listPos != (*curPos ).second.end() && listPos->scope > scope ) {
+			while ( listPos != (*curPos ).second.end() && listPos->scope > scope ) {
 				listPos++;
 			}
@@ -123,5 +123,5 @@
 	for ( tableType::iterator i = table.begin(); i != table.end(); ) {
 		list<Entry> &declList = (*i ).second;
-		while (!declList.empty() && declList.front().scope == currentScope ) {
+		while (! declList.empty() && declList.front().scope == currentScope ) {
 			declList.pop_front();
 		}