Restoring authorship annotation for <smalov@yandex-team.ru>. Commit 2 of 2.

1 files changed, 797 insertions, 797 deletions

diff --git a/contrib/tools/ragel6/csgoto.cpp b/contrib/tools/ragel6/csgoto.cpp
index 63158ccf69..4bb2ec1edf 100644
--- a/contrib/tools/ragel6/csgoto.cpp
+++ b/contrib/tools/ragel6/csgoto.cpp
@@ -1,801 +1,801 @@
-/* 
- *  Copyright 2001-2006 Adrian Thurston <thurston@complang.org> 
- *            2004 Erich Ocean <eric.ocean@ampede.com> 
- *            2005 Alan West <alan@alanz.com> 
- */ 
- 
-/*  This file is part of Ragel. 
+/*
+ *  Copyright 2001-2006 Adrian Thurston <thurston@complang.org>
+ *            2004 Erich Ocean <eric.ocean@ampede.com>
+ *            2005 Alan West <alan@alanz.com>
+ */
+
+/*  This file is part of Ragel.
+ *
+ *  Ragel is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
  * 
- *  Ragel is free software; you can redistribute it and/or modify 
- *  it under the terms of the GNU General Public License as published by 
- *  the Free Software Foundation; either version 2 of the License, or 
- *  (at your option) any later version. 
- *  
- *  Ragel is distributed in the hope that it will be useful, 
- *  but WITHOUT ANY WARRANTY; without even the implied warranty of 
- *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the 
- *  GNU General Public License for more details. 
- *  
- *  You should have received a copy of the GNU General Public License 
- *  along with Ragel; if not, write to the Free Software 
- *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA  
- */ 
- 
-#include "ragel.h" 
-#include "csgoto.h" 
-#include "redfsm.h" 
-#include "bstmap.h" 
-#include "gendata.h" 
- 
-/* Emit the goto to take for a given transition. */ 
-std::ostream &CSharpGotoCodeGen::TRANS_GOTO( RedTransAp *trans, int level ) 
-{ 
-	out << TABS(level) << "goto tr" << trans->id << ";"; 
-	return out; 
-} 
- 
-std::ostream &CSharpGotoCodeGen::TO_STATE_ACTION_SWITCH() 
-{ 
-	/* Walk the list of functions, printing the cases. */ 
-	for ( GenActionList::Iter act = actionList; act.lte(); act++ ) { 
-		/* Write out referenced actions. */ 
-		if ( act->numToStateRefs > 0 ) { 
-			/* Write the case label, the action and the case break. */ 
-			out << "\tcase " << act->actionId << ":\n"; 
-			ACTION( out, act, 0, false ); 
-			out << "\tbreak;\n"; 
-		} 
-	} 
- 
-	genLineDirective( out ); 
-	return out; 
-} 
- 
-std::ostream &CSharpGotoCodeGen::FROM_STATE_ACTION_SWITCH() 
-{ 
-	/* Walk the list of functions, printing the cases. */ 
-	for ( GenActionList::Iter act = actionList; act.lte(); act++ ) { 
-		/* Write out referenced actions. */ 
-		if ( act->numFromStateRefs > 0 ) { 
-			/* Write the case label, the action and the case break. */ 
-			out << "\tcase " << act->actionId << ":\n"; 
-			ACTION( out, act, 0, false ); 
-			out << "\tbreak;\n"; 
-		} 
-	} 
- 
-	genLineDirective( out ); 
-	return out; 
-} 
- 
-std::ostream &CSharpGotoCodeGen::EOF_ACTION_SWITCH() 
-{ 
-	/* Walk the list of functions, printing the cases. */ 
-	for ( GenActionList::Iter act = actionList; act.lte(); act++ ) { 
-		/* Write out referenced actions. */ 
-		if ( act->numEofRefs > 0 ) { 
-			/* Write the case label, the action and the case break. */ 
-			out << "\tcase " << act->actionId << ":\n"; 
-			ACTION( out, act, 0, true ); 
-			out << "\tbreak;\n"; 
-		} 
-	} 
- 
-	genLineDirective( out ); 
-	return out; 
-} 
- 
-std::ostream &CSharpGotoCodeGen::ACTION_SWITCH() 
-{ 
-	/* Walk the list of functions, printing the cases. */ 
-	for ( GenActionList::Iter act = actionList; act.lte(); act++ ) { 
-		/* Write out referenced actions. */ 
-		if ( act->numTransRefs > 0 ) { 
-			/* Write the case label, the action and the case break. */ 
-			out << "\tcase " << act->actionId << ":\n"; 
-			ACTION( out, act, 0, false ); 
-			out << "\tbreak;\n"; 
-		} 
-	} 
- 
-	genLineDirective( out ); 
-	return out; 
-} 
- 
-void CSharpGotoCodeGen::GOTO_HEADER( RedStateAp *state ) 
-{ 
-	/* Label the state. */ 
-	out << "case " << state->id << ":\n"; 
-} 
- 
- 
-void CSharpGotoCodeGen::emitSingleSwitch( RedStateAp *state ) 
-{ 
-	/* Load up the singles. */ 
-	int numSingles = state->outSingle.length(); 
-	RedTransEl *data = state->outSingle.data; 
- 
-	if ( numSingles == 1 ) { 
-		/* If there is a single single key then write it out as an if. */ 
-		out << "\tif ( " << GET_WIDE_KEY(state) << " == " <<  
-				KEY(data[0].lowKey) << " )\n\t\t";  
- 
-		/* Virtual function for writing the target of the transition. */ 
-		TRANS_GOTO(data[0].value, 0) << "\n"; 
-	} 
-	else if ( numSingles > 1 ) { 
-		/* Write out single keys in a switch if there is more than one. */ 
-		out << "\tswitch( " << GET_WIDE_KEY(state) << " ) {\n"; 
- 
-		/* Write out the single indicies. */ 
-		for ( int j = 0; j < numSingles; j++ ) { 
-			out << "\t\tcase " << ALPHA_KEY(data[j].lowKey) << ": "; 
-			TRANS_GOTO(data[j].value, 0) << "\n"; 
-		} 
-		 
-		/* Emits a default case for D code. */ 
-		SWITCH_DEFAULT(); 
- 
-		/* Close off the transition switch. */ 
-		out << "\t}\n"; 
-	} 
-} 
- 
-void CSharpGotoCodeGen::emitRangeBSearch( RedStateAp *state, int level, int low, int high ) 
-{ 
-	/* Get the mid position, staying on the lower end of the range. */ 
-	int mid = (low + high) >> 1; 
-	RedTransEl *data = state->outRange.data; 
- 
-	/* Determine if we need to look higher or lower. */ 
-	bool anyLower = mid > low; 
-	bool anyHigher = mid < high; 
- 
-	/* Determine if the keys at mid are the limits of the alphabet. */ 
-	bool limitLow = data[mid].lowKey == keyOps->minKey; 
-	bool limitHigh = data[mid].highKey == keyOps->maxKey; 
- 
-	if ( anyLower && anyHigher ) { 
-		/* Can go lower and higher than mid. */ 
-		out << TABS(level) << "if ( " << GET_WIDE_KEY(state) << " < " <<  
-				KEY(data[mid].lowKey) << " ) {\n"; 
-		emitRangeBSearch( state, level+1, low, mid-1 ); 
-		out << TABS(level) << "} else if ( " << GET_WIDE_KEY(state) << " > " <<  
-				KEY(data[mid].highKey) << " ) {\n"; 
-		emitRangeBSearch( state, level+1, mid+1, high ); 
-		out << TABS(level) << "} else\n"; 
-		TRANS_GOTO(data[mid].value, level+1) << "\n"; 
-	} 
-	else if ( anyLower && !anyHigher ) { 
-		/* Can go lower than mid but not higher. */ 
-		out << TABS(level) << "if ( " << GET_WIDE_KEY(state) << " < " <<  
-				KEY(data[mid].lowKey) << " ) {\n"; 
-		emitRangeBSearch( state, level+1, low, mid-1 ); 
- 
-		/* if the higher is the highest in the alphabet then there is no 
-		 * sense testing it. */ 
-		if ( limitHigh ) { 
-			out << TABS(level) << "} else\n"; 
-			TRANS_GOTO(data[mid].value, level+1) << "\n"; 
-		} 
-		else { 
-			out << TABS(level) << "} else if ( " << GET_WIDE_KEY(state) << " <= " <<  
-					KEY(data[mid].highKey) << " )\n"; 
-			TRANS_GOTO(data[mid].value, level+1) << "\n"; 
-		} 
-	} 
-	else if ( !anyLower && anyHigher ) { 
-		/* Can go higher than mid but not lower. */ 
-		out << TABS(level) << "if ( " << GET_WIDE_KEY(state) << " > " <<  
-				KEY(data[mid].highKey) << " ) {\n"; 
-		emitRangeBSearch( state, level+1, mid+1, high ); 
- 
-		/* If the lower end is the lowest in the alphabet then there is no 
-		 * sense testing it. */ 
-		if ( limitLow ) { 
-			out << TABS(level) << "} else\n"; 
-			TRANS_GOTO(data[mid].value, level+1) << "\n"; 
-		} 
-		else { 
-			out << TABS(level) << "} else if ( " << GET_WIDE_KEY(state) << " >= " <<  
-					KEY(data[mid].lowKey) << " )\n"; 
-			TRANS_GOTO(data[mid].value, level+1) << "\n"; 
-		} 
-	} 
-	else { 
-		/* Cannot go higher or lower than mid. It's mid or bust. What 
-		 * tests to do depends on limits of alphabet. */ 
-		if ( !limitLow && !limitHigh ) { 
-			out << TABS(level) << "if ( " << KEY(data[mid].lowKey) << " <= " <<  
-					GET_WIDE_KEY(state) << " && " << GET_WIDE_KEY(state) << " <= " <<  
-					KEY(data[mid].highKey) << " )\n"; 
-			TRANS_GOTO(data[mid].value, level+1) << "\n"; 
-		} 
-		else if ( limitLow && !limitHigh ) { 
-			out << TABS(level) << "if ( " << GET_WIDE_KEY(state) << " <= " <<  
-					KEY(data[mid].highKey) << " )\n"; 
-			TRANS_GOTO(data[mid].value, level+1) << "\n"; 
-		} 
-		else if ( !limitLow && limitHigh ) { 
-			out << TABS(level) << "if ( " << KEY(data[mid].lowKey) << " <= " <<  
-					GET_WIDE_KEY(state) << " )\n"; 
-			TRANS_GOTO(data[mid].value, level+1) << "\n"; 
-		} 
-		else { 
-			/* Both high and low are at the limit. No tests to do. */ 
-			TRANS_GOTO(data[mid].value, level+1) << "\n"; 
-		} 
-	} 
-} 
- 
-void CSharpGotoCodeGen::STATE_GOTO_ERROR() 
-{ 
-	/* Label the state and bail immediately. */ 
-	outLabelUsed = true; 
-	RedStateAp *state = redFsm->errState; 
-	out << "case " << state->id << ":\n"; 
-	out << "	goto _out;\n"; 
-} 
- 
-void CSharpGotoCodeGen::COND_TRANSLATE( GenStateCond *stateCond, int level ) 
-{ 
-	GenCondSpace *condSpace = stateCond->condSpace; 
-	out << TABS(level) << "_widec = " << CAST(WIDE_ALPH_TYPE()) << "(" << 
-			KEY(condSpace->baseKey) << " + (" << GET_KEY() <<  
-			" - " << KEY(keyOps->minKey) << "));\n"; 
- 
-	for ( GenCondSet::Iter csi = condSpace->condSet; csi.lte(); csi++ ) { 
-		out << TABS(level) << "if ( "; 
-		CONDITION( out, *csi ); 
-		Size condValOffset = ((1 << csi.pos()) * keyOps->alphSize()); 
-		out << " ) _widec += " << condValOffset << ";\n"; 
-	} 
-} 
- 
-void CSharpGotoCodeGen::emitCondBSearch( RedStateAp *state, int level, int low, int high ) 
-{ 
-	/* Get the mid position, staying on the lower end of the range. */ 
-	int mid = (low + high) >> 1; 
-	GenStateCond **data = state->stateCondVect.data; 
- 
-	/* Determine if we need to look higher or lower. */ 
-	bool anyLower = mid > low; 
-	bool anyHigher = mid < high; 
- 
-	/* Determine if the keys at mid are the limits of the alphabet. */ 
-	bool limitLow = data[mid]->lowKey == keyOps->minKey; 
-	bool limitHigh = data[mid]->highKey == keyOps->maxKey; 
- 
-	if ( anyLower && anyHigher ) { 
-		/* Can go lower and higher than mid. */ 
-		out << TABS(level) << "if ( " << GET_KEY() << " < " <<  
-				KEY(data[mid]->lowKey) << " ) {\n"; 
-		emitCondBSearch( state, level+1, low, mid-1 ); 
-		out << TABS(level) << "} else if ( " << GET_KEY() << " > " <<  
-				KEY(data[mid]->highKey) << " ) {\n"; 
-		emitCondBSearch( state, level+1, mid+1, high ); 
-		out << TABS(level) << "} else {\n"; 
-		COND_TRANSLATE(data[mid], level+1); 
-		out << TABS(level) << "}\n"; 
-	} 
-	else if ( anyLower && !anyHigher ) { 
-		/* Can go lower than mid but not higher. */ 
-		out << TABS(level) << "if ( " << GET_KEY() << " < " <<  
-				KEY(data[mid]->lowKey) << " ) {\n"; 
-		emitCondBSearch( state, level+1, low, mid-1 ); 
- 
-		/* if the higher is the highest in the alphabet then there is no 
-		 * sense testing it. */ 
-		if ( limitHigh ) { 
-			out << TABS(level) << "} else {\n"; 
-			COND_TRANSLATE(data[mid], level+1); 
-			out << TABS(level) << "}\n"; 
-		} 
-		else { 
-			out << TABS(level) << "} else if ( " << GET_KEY() << " <= " <<  
-					KEY(data[mid]->highKey) << " ) {\n"; 
-			COND_TRANSLATE(data[mid], level+1); 
-			out << TABS(level) << "}\n"; 
-		} 
-	} 
-	else if ( !anyLower && anyHigher ) { 
-		/* Can go higher than mid but not lower. */ 
-		out << TABS(level) << "if ( " << GET_KEY() << " > " <<  
-				KEY(data[mid]->highKey) << " ) {\n"; 
-		emitCondBSearch( state, level+1, mid+1, high ); 
- 
-		/* If the lower end is the lowest in the alphabet then there is no 
-		 * sense testing it. */ 
-		if ( limitLow ) { 
-			out << TABS(level) << "} else {\n"; 
-			COND_TRANSLATE(data[mid], level+1); 
-			out << TABS(level) << "}\n"; 
-		} 
-		else { 
-			out << TABS(level) << "} else if ( " << GET_KEY() << " >= " <<  
-					KEY(data[mid]->lowKey) << " ) {\n"; 
-			COND_TRANSLATE(data[mid], level+1); 
-			out << TABS(level) << "}\n"; 
-		} 
-	} 
-	else { 
-		/* Cannot go higher or lower than mid. It's mid or bust. What 
-		 * tests to do depends on limits of alphabet. */ 
-		if ( !limitLow && !limitHigh ) { 
-			out << TABS(level) << "if ( " << KEY(data[mid]->lowKey) << " <= " <<  
-					GET_KEY() << " && " << GET_KEY() << " <= " <<  
-					KEY(data[mid]->highKey) << " ) {\n"; 
-			COND_TRANSLATE(data[mid], level+1); 
-			out << TABS(level) << "}\n"; 
-		} 
-		else if ( limitLow && !limitHigh ) { 
-			out << TABS(level) << "if ( " << GET_KEY() << " <= " <<  
-					KEY(data[mid]->highKey) << " ) {\n"; 
-			COND_TRANSLATE(data[mid], level+1); 
-			out << TABS(level) << "}\n"; 
-		} 
-		else if ( !limitLow && limitHigh ) { 
-			out << TABS(level) << "if ( " << KEY(data[mid]->lowKey) << " <= " <<  
-					GET_KEY() << " )\n {"; 
-			COND_TRANSLATE(data[mid], level+1); 
-			out << TABS(level) << "}\n"; 
-		} 
-		else { 
-			/* Both high and low are at the limit. No tests to do. */ 
-			COND_TRANSLATE(data[mid], level); 
-		} 
-	} 
-} 
- 
-std::ostream &CSharpGotoCodeGen::STATE_GOTOS() 
-{ 
-	for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) { 
-		if ( st == redFsm->errState ) 
-			STATE_GOTO_ERROR(); 
-		else { 
-			/* Writing code above state gotos. */ 
-			GOTO_HEADER( st ); 
- 
-			if ( st->stateCondVect.length() > 0 ) { 
-				out << "	_widec = " << GET_KEY() << ";\n"; 
-				emitCondBSearch( st, 1, 0, st->stateCondVect.length() - 1 ); 
-			} 
- 
-			/* Try singles. */ 
-			if ( st->outSingle.length() > 0 ) 
-				emitSingleSwitch( st ); 
- 
-			/* Default case is to binary search for the ranges, if that fails then */ 
-			if ( st->outRange.length() > 0 ) 
-				emitRangeBSearch( st, 1, 0, st->outRange.length() - 1 ); 
- 
-			/* Write the default transition. */ 
-			TRANS_GOTO( st->defTrans, 1 ) << "\n"; 
-		} 
-	} 
-	return out; 
-} 
- 
-std::ostream &CSharpGotoCodeGen::TRANSITIONS() 
-{ 
-	/* Emit any transitions that have functions and that go to  
-	 * this state. */ 
-	for ( TransApSet::Iter trans = redFsm->transSet; trans.lte(); trans++ ) { 
-		/* Write the label for the transition so it can be jumped to. */ 
-		out << "	tr" << trans->id << ": "; 
- 
-		/* Destination state. */ 
-		if ( trans->action != 0 && trans->action->anyCurStateRef() ) 
-			out << "_ps = " << vCS() << ";"; 
-		out << vCS() << " = " << trans->targ->id << "; "; 
- 
-		if ( trans->action != 0 ) { 
-			/* Write out the transition func. */ 
-			out << "goto f" << trans->action->actListId << ";\n"; 
-		} 
-		else { 
-			/* No code to execute, just loop around. */ 
-			out << "goto _again;\n"; 
-		} 
-	} 
-	return out; 
-} 
- 
-std::ostream &CSharpGotoCodeGen::EXEC_FUNCS() 
-{ 
-	/* Make labels that set acts and jump to execFuncs. Loop func indicies. */ 
-	for ( GenActionTableMap::Iter redAct = redFsm->actionMap; redAct.lte(); redAct++ ) { 
-		if ( redAct->numTransRefs > 0 ) { 
-			out << "	f" << redAct->actListId << ": " << 
-				"_acts = " << itoa( redAct->location+1 ) << ";" 
-				" goto execFuncs;\n"; 
-		} 
-	} 
- 
-	out << 
-		"\n" 
-		"execFuncs:\n" 
-		"	_nacts = " << A() << "[_acts++];\n" 
-		"	while ( _nacts-- > 0 ) {\n" 
-		"		switch ( " << A() << "[_acts++] ) {\n"; 
-		ACTION_SWITCH(); 
-		SWITCH_DEFAULT() << 
-		"		}\n" 
-		"	}\n" 
-		"	goto _again;\n"; 
-	return out; 
-} 
- 
-unsigned int CSharpGotoCodeGen::TO_STATE_ACTION( RedStateAp *state ) 
-{ 
-	int act = 0; 
-	if ( state->toStateAction != 0 ) 
-		act = state->toStateAction->location+1; 
-	return act; 
-} 
- 
-unsigned int CSharpGotoCodeGen::FROM_STATE_ACTION( RedStateAp *state ) 
-{ 
-	int act = 0; 
-	if ( state->fromStateAction != 0 ) 
-		act = state->fromStateAction->location+1; 
-	return act; 
-} 
- 
-unsigned int CSharpGotoCodeGen::EOF_ACTION( RedStateAp *state ) 
-{ 
-	int act = 0; 
-	if ( state->eofAction != 0 ) 
-		act = state->eofAction->location+1; 
-	return act; 
-} 
- 
-std::ostream &CSharpGotoCodeGen::TO_STATE_ACTIONS() 
-{ 
-	/* Take one off for the psuedo start state. */ 
-	int numStates = redFsm->stateList.length(); 
-	unsigned int *vals = new unsigned int[numStates]; 
-	memset( vals, 0, sizeof(unsigned int)*numStates ); 
- 
-	for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) 
-		vals[st->id] = TO_STATE_ACTION(st); 
- 
-	out << "\t"; 
-	for ( int st = 0; st < redFsm->nextStateId; st++ ) { 
-		/* Write any eof action. */ 
-		out << vals[st]; 
-		if ( st < numStates-1 ) { 
-			out << ", "; 
-			if ( (st+1) % IALL == 0 ) 
-				out << "\n\t"; 
-		} 
-	} 
-	out << "\n"; 
-	delete[] vals; 
-	return out; 
-} 
- 
-std::ostream &CSharpGotoCodeGen::FROM_STATE_ACTIONS() 
-{ 
-	/* Take one off for the psuedo start state. */ 
-	int numStates = redFsm->stateList.length(); 
-	unsigned int *vals = new unsigned int[numStates]; 
-	memset( vals, 0, sizeof(unsigned int)*numStates ); 
- 
-	for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) 
-		vals[st->id] = FROM_STATE_ACTION(st); 
- 
-	out << "\t"; 
-	for ( int st = 0; st < redFsm->nextStateId; st++ ) { 
-		/* Write any eof action. */ 
-		out << vals[st]; 
-		if ( st < numStates-1 ) { 
-			out << ", "; 
-			if ( (st+1) % IALL == 0 ) 
-				out << "\n\t"; 
-		} 
-	} 
-	out << "\n"; 
-	delete[] vals; 
-	return out; 
-} 
- 
-std::ostream &CSharpGotoCodeGen::EOF_ACTIONS() 
-{ 
-	/* Take one off for the psuedo start state. */ 
-	int numStates = redFsm->stateList.length(); 
-	unsigned int *vals = new unsigned int[numStates]; 
-	memset( vals, 0, sizeof(unsigned int)*numStates ); 
- 
-	for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) 
-		vals[st->id] = EOF_ACTION(st); 
- 
-	out << "\t"; 
-	for ( int st = 0; st < redFsm->nextStateId; st++ ) { 
-		/* Write any eof action. */ 
-		out << vals[st]; 
-		if ( st < numStates-1 ) { 
-			out << ", "; 
-			if ( (st+1) % IALL == 0 ) 
-				out << "\n\t"; 
-		} 
-	} 
-	out << "\n"; 
-	delete[] vals; 
-	return out; 
-} 
- 
-std::ostream &CSharpGotoCodeGen::FINISH_CASES() 
-{ 
-	for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) { 
-		/* States that are final and have an out action need a case. */ 
-		if ( st->eofAction != 0 ) { 
-			/* Write the case label. */ 
-			out << "\t\tcase " << st->id << ": "; 
- 
-			/* Write the goto func. */ 
-			out << "goto f" << st->eofAction->actListId << ";\n"; 
-		} 
-	} 
-	 
-	return out; 
-} 
- 
-void CSharpGotoCodeGen::GOTO( ostream &ret, int gotoDest, bool inFinish ) 
-{ 
-	ret << "{" << vCS() << " = " << gotoDest << "; " <<  
-			CTRL_FLOW() << "goto _again;}"; 
-} 
- 
-void CSharpGotoCodeGen::GOTO_EXPR( ostream &ret, GenInlineItem *ilItem, bool inFinish ) 
-{ 
-	ret << "{" << vCS() << " = ("; 
-	INLINE_LIST( ret, ilItem->children, 0, inFinish ); 
-	ret << "); " << CTRL_FLOW() << "goto _again;}"; 
-} 
- 
-void CSharpGotoCodeGen::CURS( ostream &ret, bool inFinish ) 
-{ 
-	ret << "(_ps)"; 
-} 
- 
-void CSharpGotoCodeGen::TARGS( ostream &ret, bool inFinish, int targState ) 
-{ 
-	ret << "(" << vCS() << ")"; 
-} 
- 
-void CSharpGotoCodeGen::NEXT( ostream &ret, int nextDest, bool inFinish ) 
-{ 
-	ret << vCS() << " = " << nextDest << ";"; 
-} 
- 
-void CSharpGotoCodeGen::NEXT_EXPR( ostream &ret, GenInlineItem *ilItem, bool inFinish ) 
-{ 
-	ret << vCS() << " = ("; 
-	INLINE_LIST( ret, ilItem->children, 0, inFinish ); 
-	ret << ");"; 
-} 
- 
-void CSharpGotoCodeGen::CALL( ostream &ret, int callDest, int targState, bool inFinish ) 
-{ 
-	if ( prePushExpr != 0 ) { 
-		ret << "{"; 
-		INLINE_LIST( ret, prePushExpr, 0, false ); 
-	} 
- 
-	ret << "{" << STACK() << "[" << TOP() << "++] = " << vCS() << "; " << vCS() << " = " <<  
-			callDest << "; " << CTRL_FLOW() << "goto _again;}"; 
- 
-	if ( prePushExpr != 0 ) 
-		ret << "}"; 
-} 
- 
-void CSharpGotoCodeGen::CALL_EXPR( ostream &ret, GenInlineItem *ilItem, int targState, bool inFinish ) 
-{ 
-	if ( prePushExpr != 0 ) { 
-		ret << "{"; 
-		INLINE_LIST( ret, prePushExpr, 0, false ); 
-	} 
- 
-	ret << "{" << STACK() << "[" << TOP() << "++] = " << vCS() << "; " << vCS() << " = ("; 
-	INLINE_LIST( ret, ilItem->children, targState, inFinish ); 
-	ret << "); " << CTRL_FLOW() << "goto _again;}"; 
- 
-	if ( prePushExpr != 0 ) 
-		ret << "}"; 
-} 
- 
-void CSharpGotoCodeGen::RET( ostream &ret, bool inFinish ) 
-{ 
-	ret << "{" << vCS() << " = " << STACK() << "[--" << TOP() << "];"; 
- 
-	if ( postPopExpr != 0 ) { 
-		ret << "{"; 
-		INLINE_LIST( ret, postPopExpr, 0, false ); 
-		ret << "}"; 
-	} 
- 
-	ret << CTRL_FLOW() << "goto _again;}"; 
-} 
- 
-void CSharpGotoCodeGen::BREAK( ostream &ret, int targState ) 
-{ 
-	outLabelUsed = true; 
-	ret << "{" << P() << "++; " << CTRL_FLOW() << "goto _out; }"; 
-} 
- 
-void CSharpGotoCodeGen::writeData() 
-{ 
-	if ( redFsm->anyActions() ) { 
-		OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActArrItem), A() ); 
-		ACTIONS_ARRAY(); 
-		CLOSE_ARRAY() << 
-		"\n"; 
-	} 
- 
-	if ( redFsm->anyToStateActions() ) { 
-		OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), TSA() ); 
-		TO_STATE_ACTIONS(); 
-		CLOSE_ARRAY() << 
-		"\n"; 
-	} 
- 
-	if ( redFsm->anyFromStateActions() ) { 
-		OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), FSA() ); 
-		FROM_STATE_ACTIONS(); 
-		CLOSE_ARRAY() << 
-		"\n"; 
-	} 
- 
-	if ( redFsm->anyEofActions() ) { 
-		OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), EA() ); 
-		EOF_ACTIONS(); 
-		CLOSE_ARRAY() << 
-		"\n"; 
-	} 
- 
-	STATE_IDS(); 
-} 
- 
-void CSharpGotoCodeGen::writeExec() 
-{ 
-	testEofUsed = false; 
-	outLabelUsed = false; 
- 
-	out << "	{\n"; 
- 
-	if ( redFsm->anyRegCurStateRef() ) 
-		out << "	int _ps = 0;\n"; 
- 
-	if ( redFsm->anyToStateActions() || redFsm->anyRegActions()  
-			|| redFsm->anyFromStateActions() ) 
-	{ 
-		out <<  
-			"	" << ARRAY_TYPE(redFsm->maxActionLoc) << " _acts;\n" 
-			"	" << ARRAY_TYPE(redFsm->maxActArrItem) << " _nacts;\n"; 
-	} 
- 
-	if ( redFsm->anyConditions() ) 
-		out << "	" << WIDE_ALPH_TYPE() << " _widec;\n"; 
- 
-	out << "\n"; 
- 
-	if ( !noEnd ) { 
-		testEofUsed = true; 
-		out <<  
-			"	if ( " << P() << " == " << PE() << " )\n" 
-			"		goto _test_eof;\n"; 
-	} 
- 
-	if ( redFsm->errState != 0 ) { 
-		outLabelUsed = true; 
-		out <<  
-			"	if ( " << vCS() << " == " << redFsm->errState->id << " )\n" 
-			"		goto _out;\n"; 
-	} 
- 
-	out << "_resume:\n"; 
- 
-	if ( redFsm->anyFromStateActions() ) { 
+ *  Ragel is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ * 
+ *  You should have received a copy of the GNU General Public License
+ *  along with Ragel; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA 
+ */
+
+#include "ragel.h"
+#include "csgoto.h"
+#include "redfsm.h"
+#include "bstmap.h"
+#include "gendata.h"
+
+/* Emit the goto to take for a given transition. */
+std::ostream &CSharpGotoCodeGen::TRANS_GOTO( RedTransAp *trans, int level )
+{
+	out << TABS(level) << "goto tr" << trans->id << ";";
+	return out;
+}
+
+std::ostream &CSharpGotoCodeGen::TO_STATE_ACTION_SWITCH()
+{
+	/* Walk the list of functions, printing the cases. */
+	for ( GenActionList::Iter act = actionList; act.lte(); act++ ) {
+		/* Write out referenced actions. */
+		if ( act->numToStateRefs > 0 ) {
+			/* Write the case label, the action and the case break. */
+			out << "\tcase " << act->actionId << ":\n";
+			ACTION( out, act, 0, false );
+			out << "\tbreak;\n";
+		}
+	}
+
+	genLineDirective( out );
+	return out;
+}
+
+std::ostream &CSharpGotoCodeGen::FROM_STATE_ACTION_SWITCH()
+{
+	/* Walk the list of functions, printing the cases. */
+	for ( GenActionList::Iter act = actionList; act.lte(); act++ ) {
+		/* Write out referenced actions. */
+		if ( act->numFromStateRefs > 0 ) {
+			/* Write the case label, the action and the case break. */
+			out << "\tcase " << act->actionId << ":\n";
+			ACTION( out, act, 0, false );
+			out << "\tbreak;\n";
+		}
+	}
+
+	genLineDirective( out );
+	return out;
+}
+
+std::ostream &CSharpGotoCodeGen::EOF_ACTION_SWITCH()
+{
+	/* Walk the list of functions, printing the cases. */
+	for ( GenActionList::Iter act = actionList; act.lte(); act++ ) {
+		/* Write out referenced actions. */
+		if ( act->numEofRefs > 0 ) {
+			/* Write the case label, the action and the case break. */
+			out << "\tcase " << act->actionId << ":\n";
+			ACTION( out, act, 0, true );
+			out << "\tbreak;\n";
+		}
+	}
+
+	genLineDirective( out );
+	return out;
+}
+
+std::ostream &CSharpGotoCodeGen::ACTION_SWITCH()
+{
+	/* Walk the list of functions, printing the cases. */
+	for ( GenActionList::Iter act = actionList; act.lte(); act++ ) {
+		/* Write out referenced actions. */
+		if ( act->numTransRefs > 0 ) {
+			/* Write the case label, the action and the case break. */
+			out << "\tcase " << act->actionId << ":\n";
+			ACTION( out, act, 0, false );
+			out << "\tbreak;\n";
+		}
+	}
+
+	genLineDirective( out );
+	return out;
+}
+
+void CSharpGotoCodeGen::GOTO_HEADER( RedStateAp *state )
+{
+	/* Label the state. */
+	out << "case " << state->id << ":\n";
+}
+
+
+void CSharpGotoCodeGen::emitSingleSwitch( RedStateAp *state )
+{
+	/* Load up the singles. */
+	int numSingles = state->outSingle.length();
+	RedTransEl *data = state->outSingle.data;
+
+	if ( numSingles == 1 ) {
+		/* If there is a single single key then write it out as an if. */
+		out << "\tif ( " << GET_WIDE_KEY(state) << " == " << 
+				KEY(data[0].lowKey) << " )\n\t\t"; 
+
+		/* Virtual function for writing the target of the transition. */
+		TRANS_GOTO(data[0].value, 0) << "\n";
+	}
+	else if ( numSingles > 1 ) {
+		/* Write out single keys in a switch if there is more than one. */
+		out << "\tswitch( " << GET_WIDE_KEY(state) << " ) {\n";
+
+		/* Write out the single indicies. */
+		for ( int j = 0; j < numSingles; j++ ) {
+			out << "\t\tcase " << ALPHA_KEY(data[j].lowKey) << ": ";
+			TRANS_GOTO(data[j].value, 0) << "\n";
+		}
+		
+		/* Emits a default case for D code. */
+		SWITCH_DEFAULT();
+
+		/* Close off the transition switch. */
+		out << "\t}\n";
+	}
+}
+
+void CSharpGotoCodeGen::emitRangeBSearch( RedStateAp *state, int level, int low, int high )
+{
+	/* Get the mid position, staying on the lower end of the range. */
+	int mid = (low + high) >> 1;
+	RedTransEl *data = state->outRange.data;
+
+	/* Determine if we need to look higher or lower. */
+	bool anyLower = mid > low;
+	bool anyHigher = mid < high;
+
+	/* Determine if the keys at mid are the limits of the alphabet. */
+	bool limitLow = data[mid].lowKey == keyOps->minKey;
+	bool limitHigh = data[mid].highKey == keyOps->maxKey;
+
+	if ( anyLower && anyHigher ) {
+		/* Can go lower and higher than mid. */
+		out << TABS(level) << "if ( " << GET_WIDE_KEY(state) << " < " << 
+				KEY(data[mid].lowKey) << " ) {\n";
+		emitRangeBSearch( state, level+1, low, mid-1 );
+		out << TABS(level) << "} else if ( " << GET_WIDE_KEY(state) << " > " << 
+				KEY(data[mid].highKey) << " ) {\n";
+		emitRangeBSearch( state, level+1, mid+1, high );
+		out << TABS(level) << "} else\n";
+		TRANS_GOTO(data[mid].value, level+1) << "\n";
+	}
+	else if ( anyLower && !anyHigher ) {
+		/* Can go lower than mid but not higher. */
+		out << TABS(level) << "if ( " << GET_WIDE_KEY(state) << " < " << 
+				KEY(data[mid].lowKey) << " ) {\n";
+		emitRangeBSearch( state, level+1, low, mid-1 );
+
+		/* if the higher is the highest in the alphabet then there is no
+		 * sense testing it. */
+		if ( limitHigh ) {
+			out << TABS(level) << "} else\n";
+			TRANS_GOTO(data[mid].value, level+1) << "\n";
+		}
+		else {
+			out << TABS(level) << "} else if ( " << GET_WIDE_KEY(state) << " <= " << 
+					KEY(data[mid].highKey) << " )\n";
+			TRANS_GOTO(data[mid].value, level+1) << "\n";
+		}
+	}
+	else if ( !anyLower && anyHigher ) {
+		/* Can go higher than mid but not lower. */
+		out << TABS(level) << "if ( " << GET_WIDE_KEY(state) << " > " << 
+				KEY(data[mid].highKey) << " ) {\n";
+		emitRangeBSearch( state, level+1, mid+1, high );
+
+		/* If the lower end is the lowest in the alphabet then there is no
+		 * sense testing it. */
+		if ( limitLow ) {
+			out << TABS(level) << "} else\n";
+			TRANS_GOTO(data[mid].value, level+1) << "\n";
+		}
+		else {
+			out << TABS(level) << "} else if ( " << GET_WIDE_KEY(state) << " >= " << 
+					KEY(data[mid].lowKey) << " )\n";
+			TRANS_GOTO(data[mid].value, level+1) << "\n";
+		}
+	}
+	else {
+		/* Cannot go higher or lower than mid. It's mid or bust. What
+		 * tests to do depends on limits of alphabet. */
+		if ( !limitLow && !limitHigh ) {
+			out << TABS(level) << "if ( " << KEY(data[mid].lowKey) << " <= " << 
+					GET_WIDE_KEY(state) << " && " << GET_WIDE_KEY(state) << " <= " << 
+					KEY(data[mid].highKey) << " )\n";
+			TRANS_GOTO(data[mid].value, level+1) << "\n";
+		}
+		else if ( limitLow && !limitHigh ) {
+			out << TABS(level) << "if ( " << GET_WIDE_KEY(state) << " <= " << 
+					KEY(data[mid].highKey) << " )\n";
+			TRANS_GOTO(data[mid].value, level+1) << "\n";
+		}
+		else if ( !limitLow && limitHigh ) {
+			out << TABS(level) << "if ( " << KEY(data[mid].lowKey) << " <= " << 
+					GET_WIDE_KEY(state) << " )\n";
+			TRANS_GOTO(data[mid].value, level+1) << "\n";
+		}
+		else {
+			/* Both high and low are at the limit. No tests to do. */
+			TRANS_GOTO(data[mid].value, level+1) << "\n";
+		}
+	}
+}
+
+void CSharpGotoCodeGen::STATE_GOTO_ERROR()
+{
+	/* Label the state and bail immediately. */
+	outLabelUsed = true;
+	RedStateAp *state = redFsm->errState;
+	out << "case " << state->id << ":\n";
+	out << "	goto _out;\n";
+}
+
+void CSharpGotoCodeGen::COND_TRANSLATE( GenStateCond *stateCond, int level )
+{
+	GenCondSpace *condSpace = stateCond->condSpace;
+	out << TABS(level) << "_widec = " << CAST(WIDE_ALPH_TYPE()) << "(" <<
+			KEY(condSpace->baseKey) << " + (" << GET_KEY() << 
+			" - " << KEY(keyOps->minKey) << "));\n";
+
+	for ( GenCondSet::Iter csi = condSpace->condSet; csi.lte(); csi++ ) {
+		out << TABS(level) << "if ( ";
+		CONDITION( out, *csi );
+		Size condValOffset = ((1 << csi.pos()) * keyOps->alphSize());
+		out << " ) _widec += " << condValOffset << ";\n";
+	}
+}
+
+void CSharpGotoCodeGen::emitCondBSearch( RedStateAp *state, int level, int low, int high )
+{
+	/* Get the mid position, staying on the lower end of the range. */
+	int mid = (low + high) >> 1;
+	GenStateCond **data = state->stateCondVect.data;
+
+	/* Determine if we need to look higher or lower. */
+	bool anyLower = mid > low;
+	bool anyHigher = mid < high;
+
+	/* Determine if the keys at mid are the limits of the alphabet. */
+	bool limitLow = data[mid]->lowKey == keyOps->minKey;
+	bool limitHigh = data[mid]->highKey == keyOps->maxKey;
+
+	if ( anyLower && anyHigher ) {
+		/* Can go lower and higher than mid. */
+		out << TABS(level) << "if ( " << GET_KEY() << " < " << 
+				KEY(data[mid]->lowKey) << " ) {\n";
+		emitCondBSearch( state, level+1, low, mid-1 );
+		out << TABS(level) << "} else if ( " << GET_KEY() << " > " << 
+				KEY(data[mid]->highKey) << " ) {\n";
+		emitCondBSearch( state, level+1, mid+1, high );
+		out << TABS(level) << "} else {\n";
+		COND_TRANSLATE(data[mid], level+1);
+		out << TABS(level) << "}\n";
+	}
+	else if ( anyLower && !anyHigher ) {
+		/* Can go lower than mid but not higher. */
+		out << TABS(level) << "if ( " << GET_KEY() << " < " << 
+				KEY(data[mid]->lowKey) << " ) {\n";
+		emitCondBSearch( state, level+1, low, mid-1 );
+
+		/* if the higher is the highest in the alphabet then there is no
+		 * sense testing it. */
+		if ( limitHigh ) {
+			out << TABS(level) << "} else {\n";
+			COND_TRANSLATE(data[mid], level+1);
+			out << TABS(level) << "}\n";
+		}
+		else {
+			out << TABS(level) << "} else if ( " << GET_KEY() << " <= " << 
+					KEY(data[mid]->highKey) << " ) {\n";
+			COND_TRANSLATE(data[mid], level+1);
+			out << TABS(level) << "}\n";
+		}
+	}
+	else if ( !anyLower && anyHigher ) {
+		/* Can go higher than mid but not lower. */
+		out << TABS(level) << "if ( " << GET_KEY() << " > " << 
+				KEY(data[mid]->highKey) << " ) {\n";
+		emitCondBSearch( state, level+1, mid+1, high );
+
+		/* If the lower end is the lowest in the alphabet then there is no
+		 * sense testing it. */
+		if ( limitLow ) {
+			out << TABS(level) << "} else {\n";
+			COND_TRANSLATE(data[mid], level+1);
+			out << TABS(level) << "}\n";
+		}
+		else {
+			out << TABS(level) << "} else if ( " << GET_KEY() << " >= " << 
+					KEY(data[mid]->lowKey) << " ) {\n";
+			COND_TRANSLATE(data[mid], level+1);
+			out << TABS(level) << "}\n";
+		}
+	}
+	else {
+		/* Cannot go higher or lower than mid. It's mid or bust. What
+		 * tests to do depends on limits of alphabet. */
+		if ( !limitLow && !limitHigh ) {
+			out << TABS(level) << "if ( " << KEY(data[mid]->lowKey) << " <= " << 
+					GET_KEY() << " && " << GET_KEY() << " <= " << 
+					KEY(data[mid]->highKey) << " ) {\n";
+			COND_TRANSLATE(data[mid], level+1);
+			out << TABS(level) << "}\n";
+		}
+		else if ( limitLow && !limitHigh ) {
+			out << TABS(level) << "if ( " << GET_KEY() << " <= " << 
+					KEY(data[mid]->highKey) << " ) {\n";
+			COND_TRANSLATE(data[mid], level+1);
+			out << TABS(level) << "}\n";
+		}
+		else if ( !limitLow && limitHigh ) {
+			out << TABS(level) << "if ( " << KEY(data[mid]->lowKey) << " <= " << 
+					GET_KEY() << " )\n {";
+			COND_TRANSLATE(data[mid], level+1);
+			out << TABS(level) << "}\n";
+		}
+		else {
+			/* Both high and low are at the limit. No tests to do. */
+			COND_TRANSLATE(data[mid], level);
+		}
+	}
+}
+
+std::ostream &CSharpGotoCodeGen::STATE_GOTOS()
+{
+	for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
+		if ( st == redFsm->errState )
+			STATE_GOTO_ERROR();
+		else {
+			/* Writing code above state gotos. */
+			GOTO_HEADER( st );
+
+			if ( st->stateCondVect.length() > 0 ) {
+				out << "	_widec = " << GET_KEY() << ";\n";
+				emitCondBSearch( st, 1, 0, st->stateCondVect.length() - 1 );
+			}
+
+			/* Try singles. */
+			if ( st->outSingle.length() > 0 )
+				emitSingleSwitch( st );
+
+			/* Default case is to binary search for the ranges, if that fails then */
+			if ( st->outRange.length() > 0 )
+				emitRangeBSearch( st, 1, 0, st->outRange.length() - 1 );
+
+			/* Write the default transition. */
+			TRANS_GOTO( st->defTrans, 1 ) << "\n";
+		}
+	}
+	return out;
+}
+
+std::ostream &CSharpGotoCodeGen::TRANSITIONS()
+{
+	/* Emit any transitions that have functions and that go to 
+	 * this state. */
+	for ( TransApSet::Iter trans = redFsm->transSet; trans.lte(); trans++ ) {
+		/* Write the label for the transition so it can be jumped to. */
+		out << "	tr" << trans->id << ": ";
+
+		/* Destination state. */
+		if ( trans->action != 0 && trans->action->anyCurStateRef() )
+			out << "_ps = " << vCS() << ";";
+		out << vCS() << " = " << trans->targ->id << "; ";
+
+		if ( trans->action != 0 ) {
+			/* Write out the transition func. */
+			out << "goto f" << trans->action->actListId << ";\n";
+		}
+		else {
+			/* No code to execute, just loop around. */
+			out << "goto _again;\n";
+		}
+	}
+	return out;
+}
+
+std::ostream &CSharpGotoCodeGen::EXEC_FUNCS()
+{
+	/* Make labels that set acts and jump to execFuncs. Loop func indicies. */
+	for ( GenActionTableMap::Iter redAct = redFsm->actionMap; redAct.lte(); redAct++ ) {
+		if ( redAct->numTransRefs > 0 ) {
+			out << "	f" << redAct->actListId << ": " <<
+				"_acts = " << itoa( redAct->location+1 ) << ";"
+				" goto execFuncs;\n";
+		}
+	}
+
+	out <<
+		"\n"
+		"execFuncs:\n"
+		"	_nacts = " << A() << "[_acts++];\n"
+		"	while ( _nacts-- > 0 ) {\n"
+		"		switch ( " << A() << "[_acts++] ) {\n";
+		ACTION_SWITCH();
+		SWITCH_DEFAULT() <<
+		"		}\n"
+		"	}\n"
+		"	goto _again;\n";
+	return out;
+}
+
+unsigned int CSharpGotoCodeGen::TO_STATE_ACTION( RedStateAp *state )
+{
+	int act = 0;
+	if ( state->toStateAction != 0 )
+		act = state->toStateAction->location+1;
+	return act;
+}
+
+unsigned int CSharpGotoCodeGen::FROM_STATE_ACTION( RedStateAp *state )
+{
+	int act = 0;
+	if ( state->fromStateAction != 0 )
+		act = state->fromStateAction->location+1;
+	return act;
+}
+
+unsigned int CSharpGotoCodeGen::EOF_ACTION( RedStateAp *state )
+{
+	int act = 0;
+	if ( state->eofAction != 0 )
+		act = state->eofAction->location+1;
+	return act;
+}
+
+std::ostream &CSharpGotoCodeGen::TO_STATE_ACTIONS()
+{
+	/* Take one off for the psuedo start state. */
+	int numStates = redFsm->stateList.length();
+	unsigned int *vals = new unsigned int[numStates];
+	memset( vals, 0, sizeof(unsigned int)*numStates );
+
+	for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ )
+		vals[st->id] = TO_STATE_ACTION(st);
+
+	out << "\t";
+	for ( int st = 0; st < redFsm->nextStateId; st++ ) {
+		/* Write any eof action. */
+		out << vals[st];
+		if ( st < numStates-1 ) {
+			out << ", ";
+			if ( (st+1) % IALL == 0 )
+				out << "\n\t";
+		}
+	}
+	out << "\n";
+	delete[] vals;
+	return out;
+}
+
+std::ostream &CSharpGotoCodeGen::FROM_STATE_ACTIONS()
+{
+	/* Take one off for the psuedo start state. */
+	int numStates = redFsm->stateList.length();
+	unsigned int *vals = new unsigned int[numStates];
+	memset( vals, 0, sizeof(unsigned int)*numStates );
+
+	for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ )
+		vals[st->id] = FROM_STATE_ACTION(st);
+
+	out << "\t";
+	for ( int st = 0; st < redFsm->nextStateId; st++ ) {
+		/* Write any eof action. */
+		out << vals[st];
+		if ( st < numStates-1 ) {
+			out << ", ";
+			if ( (st+1) % IALL == 0 )
+				out << "\n\t";
+		}
+	}
+	out << "\n";
+	delete[] vals;
+	return out;
+}
+
+std::ostream &CSharpGotoCodeGen::EOF_ACTIONS()
+{
+	/* Take one off for the psuedo start state. */
+	int numStates = redFsm->stateList.length();
+	unsigned int *vals = new unsigned int[numStates];
+	memset( vals, 0, sizeof(unsigned int)*numStates );
+
+	for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ )
+		vals[st->id] = EOF_ACTION(st);
+
+	out << "\t";
+	for ( int st = 0; st < redFsm->nextStateId; st++ ) {
+		/* Write any eof action. */
+		out << vals[st];
+		if ( st < numStates-1 ) {
+			out << ", ";
+			if ( (st+1) % IALL == 0 )
+				out << "\n\t";
+		}
+	}
+	out << "\n";
+	delete[] vals;
+	return out;
+}
+
+std::ostream &CSharpGotoCodeGen::FINISH_CASES()
+{
+	for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
+		/* States that are final and have an out action need a case. */
+		if ( st->eofAction != 0 ) {
+			/* Write the case label. */
+			out << "\t\tcase " << st->id << ": ";
+
+			/* Write the goto func. */
+			out << "goto f" << st->eofAction->actListId << ";\n";
+		}
+	}
+	
+	return out;
+}
+
+void CSharpGotoCodeGen::GOTO( ostream &ret, int gotoDest, bool inFinish )
+{
+	ret << "{" << vCS() << " = " << gotoDest << "; " << 
+			CTRL_FLOW() << "goto _again;}";
+}
+
+void CSharpGotoCodeGen::GOTO_EXPR( ostream &ret, GenInlineItem *ilItem, bool inFinish )
+{
+	ret << "{" << vCS() << " = (";
+	INLINE_LIST( ret, ilItem->children, 0, inFinish );
+	ret << "); " << CTRL_FLOW() << "goto _again;}";
+}
+
+void CSharpGotoCodeGen::CURS( ostream &ret, bool inFinish )
+{
+	ret << "(_ps)";
+}
+
+void CSharpGotoCodeGen::TARGS( ostream &ret, bool inFinish, int targState )
+{
+	ret << "(" << vCS() << ")";
+}
+
+void CSharpGotoCodeGen::NEXT( ostream &ret, int nextDest, bool inFinish )
+{
+	ret << vCS() << " = " << nextDest << ";";
+}
+
+void CSharpGotoCodeGen::NEXT_EXPR( ostream &ret, GenInlineItem *ilItem, bool inFinish )
+{
+	ret << vCS() << " = (";
+	INLINE_LIST( ret, ilItem->children, 0, inFinish );
+	ret << ");";
+}
+
+void CSharpGotoCodeGen::CALL( ostream &ret, int callDest, int targState, bool inFinish )
+{
+	if ( prePushExpr != 0 ) {
+		ret << "{";
+		INLINE_LIST( ret, prePushExpr, 0, false );
+	}
+
+	ret << "{" << STACK() << "[" << TOP() << "++] = " << vCS() << "; " << vCS() << " = " << 
+			callDest << "; " << CTRL_FLOW() << "goto _again;}";
+
+	if ( prePushExpr != 0 )
+		ret << "}";
+}
+
+void CSharpGotoCodeGen::CALL_EXPR( ostream &ret, GenInlineItem *ilItem, int targState, bool inFinish )
+{
+	if ( prePushExpr != 0 ) {
+		ret << "{";
+		INLINE_LIST( ret, prePushExpr, 0, false );
+	}
+
+	ret << "{" << STACK() << "[" << TOP() << "++] = " << vCS() << "; " << vCS() << " = (";
+	INLINE_LIST( ret, ilItem->children, targState, inFinish );
+	ret << "); " << CTRL_FLOW() << "goto _again;}";
+
+	if ( prePushExpr != 0 )
+		ret << "}";
+}
+
+void CSharpGotoCodeGen::RET( ostream &ret, bool inFinish )
+{
+	ret << "{" << vCS() << " = " << STACK() << "[--" << TOP() << "];";
+
+	if ( postPopExpr != 0 ) {
+		ret << "{";
+		INLINE_LIST( ret, postPopExpr, 0, false );
+		ret << "}";
+	}
+
+	ret << CTRL_FLOW() << "goto _again;}";
+}
+
+void CSharpGotoCodeGen::BREAK( ostream &ret, int targState )
+{
+	outLabelUsed = true;
+	ret << "{" << P() << "++; " << CTRL_FLOW() << "goto _out; }";
+}
+
+void CSharpGotoCodeGen::writeData()
+{
+	if ( redFsm->anyActions() ) {
+		OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActArrItem), A() );
+		ACTIONS_ARRAY();
+		CLOSE_ARRAY() <<
+		"\n";
+	}
+
+	if ( redFsm->anyToStateActions() ) {
+		OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), TSA() );
+		TO_STATE_ACTIONS();
+		CLOSE_ARRAY() <<
+		"\n";
+	}
+
+	if ( redFsm->anyFromStateActions() ) {
+		OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), FSA() );
+		FROM_STATE_ACTIONS();
+		CLOSE_ARRAY() <<
+		"\n";
+	}
+
+	if ( redFsm->anyEofActions() ) {
+		OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), EA() );
+		EOF_ACTIONS();
+		CLOSE_ARRAY() <<
+		"\n";
+	}
+
+	STATE_IDS();
+}
+
+void CSharpGotoCodeGen::writeExec()
+{
+	testEofUsed = false;
+	outLabelUsed = false;
+
+	out << "	{\n";
+
+	if ( redFsm->anyRegCurStateRef() )
+		out << "	int _ps = 0;\n";
+
+	if ( redFsm->anyToStateActions() || redFsm->anyRegActions() 
+			|| redFsm->anyFromStateActions() )
+	{
+		out << 
+			"	" << ARRAY_TYPE(redFsm->maxActionLoc) << " _acts;\n"
+			"	" << ARRAY_TYPE(redFsm->maxActArrItem) << " _nacts;\n";
+	}
+
+	if ( redFsm->anyConditions() )
+		out << "	" << WIDE_ALPH_TYPE() << " _widec;\n";
+
+	out << "\n";
+
+	if ( !noEnd ) {
+		testEofUsed = true;
+		out << 
+			"	if ( " << P() << " == " << PE() << " )\n"
+			"		goto _test_eof;\n";
+	}
+
+	if ( redFsm->errState != 0 ) {
+		outLabelUsed = true;
+		out << 
+			"	if ( " << vCS() << " == " << redFsm->errState->id << " )\n"
+			"		goto _out;\n";
+	}
+
+	out << "_resume:\n";
+
+	if ( redFsm->anyFromStateActions() ) {
+		out <<
+			"	_acts = " << FSA() << "[" << vCS() << "];\n"
+			"	_nacts = " << A() << "[_acts++];\n"
+			"	while ( _nacts-- > 0 ) {\n"
+			"		switch ( " << A() << "[_acts++] ) {\n";
+			FROM_STATE_ACTION_SWITCH();
+			SWITCH_DEFAULT() <<
+			"		}\n"
+			"	}\n"
+			"\n";
+	}
+
+	out <<
+		"	switch ( " << vCS() << " ) {\n";
+		STATE_GOTOS();
+		SWITCH_DEFAULT() <<
+		"	}\n"
+		"\n";
+		TRANSITIONS() <<
+		"\n";
+
+	if ( redFsm->anyRegActions() )
+		EXEC_FUNCS() << "\n";
+
+	out << "_again:\n";
+
+	if ( redFsm->anyToStateActions() ) {
+		out <<
+			"	_acts = " << TSA() << "[" << vCS() << "];\n"
+			"	_nacts = " << A() << "[_acts++];\n"
+			"	while ( _nacts-- > 0 ) {\n"
+			"		switch ( " << A() << "[_acts++] ) {\n";
+			TO_STATE_ACTION_SWITCH();
+			SWITCH_DEFAULT() <<
+			"		}\n"
+			"	}\n"
+			"\n";
+	}
+
+	if ( redFsm->errState != 0 ) {
+		outLabelUsed = true;
+		out << 
+			"	if ( " << vCS() << " == " << redFsm->errState->id << " )\n"
+			"		goto _out;\n";
+	}
+
+	if ( !noEnd ) {
 		out << 
-			"	_acts = " << FSA() << "[" << vCS() << "];\n" 
-			"	_nacts = " << A() << "[_acts++];\n" 
-			"	while ( _nacts-- > 0 ) {\n" 
-			"		switch ( " << A() << "[_acts++] ) {\n"; 
-			FROM_STATE_ACTION_SWITCH(); 
-			SWITCH_DEFAULT() << 
-			"		}\n" 
-			"	}\n" 
-			"\n"; 
-	} 
- 
-	out << 
-		"	switch ( " << vCS() << " ) {\n"; 
-		STATE_GOTOS(); 
-		SWITCH_DEFAULT() << 
-		"	}\n" 
-		"\n"; 
-		TRANSITIONS() << 
-		"\n"; 
- 
-	if ( redFsm->anyRegActions() ) 
-		EXEC_FUNCS() << "\n"; 
- 
-	out << "_again:\n"; 
- 
-	if ( redFsm->anyToStateActions() ) { 
+			"	if ( ++" << P() << " != " << PE() << " )\n"
+			"		goto _resume;\n";
+	}
+	else {
 		out << 
-			"	_acts = " << TSA() << "[" << vCS() << "];\n" 
-			"	_nacts = " << A() << "[_acts++];\n" 
-			"	while ( _nacts-- > 0 ) {\n" 
-			"		switch ( " << A() << "[_acts++] ) {\n"; 
-			TO_STATE_ACTION_SWITCH(); 
-			SWITCH_DEFAULT() << 
-			"		}\n" 
-			"	}\n" 
-			"\n"; 
-	} 
- 
-	if ( redFsm->errState != 0 ) { 
-		outLabelUsed = true; 
-		out <<  
-			"	if ( " << vCS() << " == " << redFsm->errState->id << " )\n" 
-			"		goto _out;\n"; 
-	} 
- 
-	if ( !noEnd ) { 
-		out <<  
-			"	if ( ++" << P() << " != " << PE() << " )\n" 
-			"		goto _resume;\n"; 
-	} 
-	else { 
-		out <<  
-			"	" << P() << " += 1;\n" 
-			"	goto _resume;\n"; 
-	} 
- 
-	if ( testEofUsed ) 
-		out << "	_test_eof: {}\n"; 
- 
-	if ( redFsm->anyEofTrans() || redFsm->anyEofActions() ) { 
-		out <<  
-			"	if ( " << P() << " == " << vEOF() << " )\n" 
-			"	{\n"; 
- 
-		if ( redFsm->anyEofTrans() ) { 
-			out << 
-				"	switch ( " << vCS() << " ) {\n"; 
- 
-			for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) { 
-				if ( st->eofTrans != 0 ) 
-					out << "	case " << st->id << ": goto tr" << st->eofTrans->id << ";\n"; 
-			} 
- 
-			SWITCH_DEFAULT() << 
-				"	}\n"; 
-		} 
- 
-		if ( redFsm->anyEofActions() ) { 
-			out << 
-				"	" << ARRAY_TYPE(redFsm->maxActionLoc) << " __acts = " <<  
-						EA() << "[" << vCS() << "];\n" 
-				"	" << ARRAY_TYPE(redFsm->maxActArrItem) << " __nacts = " << 
-					A() << "[__acts++];\n" 
-				"	while ( __nacts-- > 0 ) {\n" 
-				"		switch ( " << A() << "[__acts++] ) {\n"; 
-				EOF_ACTION_SWITCH(); 
-				SWITCH_DEFAULT() << 
-				"		}\n" 
-				"	}\n"; 
-		} 
- 
+			"	" << P() << " += 1;\n"
+			"	goto _resume;\n";
+	}
+
+	if ( testEofUsed )
+		out << "	_test_eof: {}\n";
+
+	if ( redFsm->anyEofTrans() || redFsm->anyEofActions() ) {
 		out << 
-			"	}\n" 
-			"\n"; 
-	} 
- 
-	if ( outLabelUsed ) 
-		out << "	_out: {}\n"; 
- 
-	out << "	}\n"; 
-} 
+			"	if ( " << P() << " == " << vEOF() << " )\n"
+			"	{\n";
+
+		if ( redFsm->anyEofTrans() ) {
+			out <<
+				"	switch ( " << vCS() << " ) {\n";
+
+			for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
+				if ( st->eofTrans != 0 )
+					out << "	case " << st->id << ": goto tr" << st->eofTrans->id << ";\n";
+			}
+
+			SWITCH_DEFAULT() <<
+				"	}\n";
+		}
+
+		if ( redFsm->anyEofActions() ) {
+			out <<
+				"	" << ARRAY_TYPE(redFsm->maxActionLoc) << " __acts = " << 
+						EA() << "[" << vCS() << "];\n"
+				"	" << ARRAY_TYPE(redFsm->maxActArrItem) << " __nacts = " <<
+					A() << "[__acts++];\n"
+				"	while ( __nacts-- > 0 ) {\n"
+				"		switch ( " << A() << "[__acts++] ) {\n";
+				EOF_ACTION_SWITCH();
+				SWITCH_DEFAULT() <<
+				"		}\n"
+				"	}\n";
+		}
+
+		out <<
+			"	}\n"
+			"\n";
+	}
+
+	if ( outLabelUsed )
+		out << "	_out: {}\n";
+
+	out << "	}\n";
+}