Index: translator/Parser/ExpressionNode.cc
===================================================================
--- translator/Parser/ExpressionNode.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
+++ translator/Parser/ExpressionNode.cc	(revision a08ba927e920255639a48d814cce47347723392a)
@@ -81,5 +81,5 @@
 }
 
-CommaExprNode *ExpressionNode::add_to_list( ExpressionNode *exp ){
+CommaExprNode *ExpressionNode::add_to_list( ExpressionNode *exp ) {
 	return new CommaExprNode( this, exp );
 }
@@ -111,6 +111,6 @@
 }
 
-void ConstantNode::classify( std::string &str ){
-	switch ( type ){
+void ConstantNode::classify( std::string &str ) {
+	switch ( type ) {
 	  case Integer:
 	  case Float:
@@ -130,7 +130,7 @@
 			std::transform( sfx.begin(), sfx.end(), sfx.begin(), tolower_hack );
 
-			if ( sfx.find("ll") != string::npos ){
+			if ( sfx.find("ll") != string::npos ) {
 				longs = 2;
-			} else if ( sfx.find("l") != string::npos ){
+			} else if ( sfx.find("l") != string::npos ) {
 				longs = 1;
 			} // if
@@ -163,5 +163,5 @@
 ConstantNode *ConstantNode::append( std::string *newValue ) {
 	if ( newValue ) {
-		if ( type == String ){
+		if ( type == String ) {
 			std::string temp = *newValue;
 			value.resize( value.size() - 1 );
@@ -209,5 +209,5 @@
 	BasicType *bt;
 
-	switch ( get_type()){
+	switch ( get_type()) {
 	  case Integer:
 		/* Cfr. standard 6.4.4.1 */
@@ -354,5 +354,5 @@
 		return new UntypedExpr( function->build(), args, maybeBuild< Expression >( get_argName() ));
 	} else {
-		switch ( op->get_type()){
+		switch ( op->get_type()) {
 		  case OperatorNode::Incr:
 		  case OperatorNode::Decr:
@@ -563,9 +563,9 @@
 }
 
-void CompositeExprNode::set_function( ExpressionNode *f ){
+void CompositeExprNode::set_function( ExpressionNode *f ) {
 	function = f;
 }
 
-void CompositeExprNode::set_args( ExpressionNode *args ){
+void CompositeExprNode::set_args( ExpressionNode *args ) {
 	arguments = args;
 }
@@ -579,5 +579,5 @@
 }
 
-void CompositeExprNode::add_arg( ExpressionNode *arg ){
+void CompositeExprNode::add_arg( ExpressionNode *arg ) {
 	if ( arguments )
 		arguments->set_link( arg );
@@ -594,5 +594,5 @@
 }
 
-CommaExprNode *CommaExprNode::add_to_list( ExpressionNode *exp ){
+CommaExprNode *CommaExprNode::add_to_list( ExpressionNode *exp ) {
 	add_arg( exp );
 
@@ -646,5 +646,5 @@
 }
 
-ForCtlExprNode::~ForCtlExprNode(){
+ForCtlExprNode::~ForCtlExprNode() {
 	delete init;
 	delete condition;
Index: translator/Parser/ParseNode.cc
===================================================================
--- translator/Parser/ParseNode.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
+++ translator/Parser/ParseNode.cc	(revision a08ba927e920255639a48d814cce47347723392a)
@@ -10,6 +10,6 @@
 // Created On       : Sat May 16 13:26:29 2015
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Sat May 16 13:27:51 2015
-// Update Count     : 2
+// Last Modified On : Tue May 19 16:48:30 2015
+// Update Count     : 3
 // 
 
@@ -24,49 +24,49 @@
 
 ParseNode *ParseNode::set_name( string _name ) {
-    name = _name;
-    return this;
+	name = _name;
+	return this;
 }
 
 ParseNode *ParseNode::set_name( string *_name ) {
-    name = *_name; // deep copy
-    delete _name;
+	name = *_name; // deep copy
+	delete _name;
 
-    return this;
+	return this;
 }
 
 ParseNode::~ParseNode( void ) {
-    delete next;
+	delete next;
 };
 
 string ParseNode::get_name( void ) {
-    return name;
+	return name;
 }
 
 ParseNode *ParseNode::get_link( void ) const {
-    return next;
+	return next;
 }
 
 ParseNode *ParseNode::get_last(void) {
-    ParseNode *current = this;
+	ParseNode *current = this;
 
-    while ( current->get_link() != 0 )
+	while ( current->get_link() != 0 )
 	current = current->get_link();
 
-    return current;
+	return current;
 }
 
-ParseNode *ParseNode::set_link(ParseNode *_next){
-    ParseNode *follow;
+ParseNode *ParseNode::set_link(ParseNode *_next) {
+	ParseNode *follow;
 
-    if ( _next == 0 ) return this;
+	if ( _next == 0 ) return this;
 
-    for ( follow = this; follow->next != 0; follow = follow->next );
-    follow->next = _next;
+	for ( follow = this; follow->next != 0; follow = follow->next );
+	follow->next = _next;
 
-    return this;
+	return this;
 }
 
 const string ParseNode::get_name(void) const {
-    return name;
+	return name;
 }
 
@@ -75,22 +75,22 @@
 
 void ParseNode::printList( std::ostream &os, int indent ) const {
-    print( os, indent );
+	print( os, indent );
 
-    if ( next ) {
+	if ( next ) {
 	next->printList( os, indent );
-    }
+	}
 }
 
 ParseNode &ParseNode::operator,( ParseNode &p ) {
-    set_link( &p );
+	set_link( &p );
 
-    return *this;
+	return *this;
 }
 
 ParseNode *mkList( ParseNode &pn ) {
-    // it just relies on `operator,' to take care of the "arguments" and provides a nice interface to an awful-looking
-    // address-of, rendering, for example (StatementNode *)(&(*$5 + *$7)) into (StatementNode *)mkList(($5, $7))
-    // (although "nice" is probably not the word)
-    return &pn;
+	// it just relies on `operator,' to take care of the "arguments" and provides a nice interface to an awful-looking
+	// address-of, rendering, for example (StatementNode *)(&(*$5 + *$7)) into (StatementNode *)mkList(($5, $7))
+	// (although "nice" is probably not the word)
+	return &pn;
 }
 
Index: translator/Parser/StatementNode.cc
===================================================================
--- translator/Parser/StatementNode.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
+++ translator/Parser/StatementNode.cc	(revision a08ba927e920255639a48d814cce47347723392a)
@@ -171,5 +171,5 @@
 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;
 
Index: translator/Parser/TypedefTable.cc
===================================================================
--- translator/Parser/TypedefTable.cc	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
+++ translator/Parser/TypedefTable.cc	(revision a08ba927e920255639a48d814cce47347723392a)
@@ -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();
 		}
Index: translator/Parser/lex.l
===================================================================
--- translator/Parser/lex.l	(revision a32b204359041ff1f6ef505a929495bcfe7a54f3)
+++ translator/Parser/lex.l	(revision a08ba927e920255639a48d814cce47347723392a)
@@ -10,6 +10,6 @@
  * Created On       : Sat Sep 22 08:58:10 2001
  * Last Modified By : Peter A. Buhr
- * Last Modified On : Sat May 16 12:14:18 2015
- * Update Count     : 330
+ * Last Modified On : Tue May 19 15:41:54 2015
+ * Update Count     : 331
  */