void FFlatCodeGen::writeExec()
{
testEofUsed = false;
outLabelUsed = false;
out <<
L" {\n"
L" int _slen";
if ( redFsm->anyRegCurStateRef() )
out << L", _ps";
out << L";\n";
out << L" int _trans";
if ( redFsm->anyConditions() )
out << L", _cond";
out << L";\n";
out <<
L" " << PTR_CONST() << WIDE_ALPH_TYPE() << PTR_CONST_END() << POINTER() << L"_keys;\n"
L" " << PTR_CONST() << ARRAY_TYPE(redFsm->maxIndex) << PTR_CONST_END() << POINTER() << L"_inds;\n";
if ( redFsm->anyConditions() ) {
out <<
L" " << PTR_CONST() << ARRAY_TYPE(redFsm->maxCond) << PTR_CONST_END() << POINTER() << L"_conds;\n"
L" " << WIDE_ALPH_TYPE() << L" _widec;\n";
}
if ( !noEnd ) {
testEofUsed = true;
out <<
L" if ( " << P() << L" == " << PE() << L" )\n"
L" goto _test_eof;\n";
}
if ( redFsm->errState != 0 ) {
outLabelUsed = true;
out <<
L" if ( " << vCS() << L" == " << redFsm->errState->id << L" )\n"
L" goto _out;\n";
}
out << L"_resume:\n";
if ( redFsm->anyFromStateActions() ) {
out <<
L" switch ( " << FSA() << L"[" << vCS() << L"] ) {\n";
FROM_STATE_ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" }\n"
L"\n";
}
if ( redFsm->anyConditions() )
COND_TRANSLATE();
LOCATE_TRANS();
if ( redFsm->anyEofTrans() )
out << L"_eof_trans:\n";
if ( redFsm->anyRegCurStateRef() )
out << L" _ps = " << vCS() << L";\n";
out <<
L" " << vCS() << L" = " << TT() << L"[_trans];\n\n";
if ( redFsm->anyRegActions() ) {
out <<
L" if ( " << TA() << L"[_trans] == 0 )\n"
L" goto _again;\n"
L"\n"
L" switch ( " << TA() << L"[_trans] ) {\n";
ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" }\n"
L"\n";
}
if ( redFsm->anyRegActions() || redFsm->anyActionGotos() ||
redFsm->anyActionCalls() || redFsm->anyActionRets() )
out << L"_again:\n";
if ( redFsm->anyToStateActions() ) {
out <<
L" switch ( " << TSA() << L"[" << vCS() << L"] ) {\n";
TO_STATE_ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" }\n"
L"\n";
}
if ( redFsm->errState != 0 ) {
outLabelUsed = true;
out <<
L" if ( " << vCS() << L" == " << redFsm->errState->id << L" )\n"
L" goto _out;\n";
}
if ( !noEnd ) {
out <<
L" if ( ++" << P() << L" != " << PE() << L" )\n"
L" goto _resume;\n";
}
else {
out <<
L" " << P() << L" += 1;\n"
L" goto _resume;\n";
}
if ( testEofUsed )
out << L" _test_eof: {}\n";
if ( redFsm->anyEofTrans() || redFsm->anyEofActions() ) {
out <<
L" if ( " << P() << L" == " << vEOF() << L" )\n"
L" {\n";
if ( redFsm->anyEofTrans() ) {
out <<
L" if ( " << ET() << L"[" << vCS() << L"] > 0 ) {\n"
L" _trans = " << ET() << L"[" << vCS() << L"] - 1;\n"
L" goto _eof_trans;\n"
L" }\n";
}
if ( redFsm->anyEofActions() ) {
out <<
L" switch ( " << EA() << L"[" << vCS() << L"] ) {\n";
EOF_ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" }\n";
}
out <<
L" }\n"
L"\n";
}
if ( outLabelUsed )
out << L" _out: {}\n";
out << L" }\n";
}
void TabCodeGen::writeExec()
{
testEofUsed = false;
outLabelUsed = false;
out <<
" {\n"
" int _klen";
if ( redFsm->anyRegCurStateRef() )
out << ", _ps";
out <<
";\n"
" " << UINT() << " _trans;\n";
if ( redFsm->anyConditions() )
out << " " << WIDE_ALPH_TYPE() << " _widec;\n";
if ( redFsm->anyToStateActions() || redFsm->anyRegActions()
|| redFsm->anyFromStateActions() )
{
out <<
" " << PTR_CONST() << ARRAY_TYPE(redFsm->maxActArrItem) << PTR_CONST_END() <<
POINTER() << "_acts;\n"
" " << UINT() << " _nacts;\n";
}
out <<
" " << PTR_CONST() << WIDE_ALPH_TYPE() << PTR_CONST_END() << POINTER() << "_keys;\n"
"\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 = " << ARR_OFF( A(), FSA() + "[" + vCS() + "]" ) << ";\n"
" _nacts = " << CAST(UINT()) << " *_acts++;\n"
" while ( _nacts-- > 0 ) {\n"
" switch ( *_acts++ ) {\n";
FROM_STATE_ACTION_SWITCH();
SWITCH_DEFAULT() <<
" }\n"
" }\n"
"\n";
}
if ( redFsm->anyConditions() )
COND_TRANSLATE();
LOCATE_TRANS();
out << "_match:\n";
if ( useIndicies )
out << " _trans = " << I() << "[_trans];\n";
if ( redFsm->anyEofTrans() )
out << "_eof_trans:\n";
if ( redFsm->anyRegCurStateRef() )
out << " _ps = " << vCS() << ";\n";
out <<
" " << vCS() << " = " << TT() << "[_trans];\n"
"\n";
if ( redFsm->anyRegActions() ) {
out <<
" if ( " << TA() << "[_trans] == 0 )\n"
" goto _again;\n"
"\n"
" _acts = " << ARR_OFF( A(), TA() + "[_trans]" ) << ";\n"
" _nacts = " << CAST(UINT()) << " *_acts++;\n"
" while ( _nacts-- > 0 )\n {\n"
" switch ( *_acts++ )\n {\n";
ACTION_SWITCH();
SWITCH_DEFAULT() <<
" }\n"
" }\n"
"\n";
}
if ( redFsm->anyRegActions() || redFsm->anyActionGotos() ||
redFsm->anyActionCalls() || redFsm->anyActionRets() )
out << "_again:\n";
if ( redFsm->anyToStateActions() ) {
out <<
" _acts = " << ARR_OFF( A(), TSA() + "[" + vCS() + "]" ) << ";\n"
" _nacts = " << CAST(UINT()) << " *_acts++;\n"
" while ( _nacts-- > 0 ) {\n"
" switch ( *_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 <<
" if ( " << ET() << "[" << vCS() << "] > 0 ) {\n"
" _trans = " << ET() << "[" << vCS() << "] - 1;\n"
" goto _eof_trans;\n"
" }\n";
}
if ( redFsm->anyEofActions() ) {
out <<
" " << PTR_CONST() << ARRAY_TYPE(redFsm->maxActArrItem) << PTR_CONST_END() <<
POINTER() << "__acts = " <<
ARR_OFF( A(), EA() + "[" + vCS() + "]" ) << ";\n"
" " << UINT() << " __nacts = " << CAST(UINT()) << " *__acts++;\n"
" while ( __nacts-- > 0 ) {\n"
" switch ( *__acts++ ) {\n";
EOF_ACTION_SWITCH();
SWITCH_DEFAULT() <<
" }\n"
" }\n";
}
out <<
" }\n"
"\n";
}
if ( outLabelUsed )
out << " _out: {}\n";
out << " }\n";
}
void CSharpFlatCodeGen::writeExec()
{
testEofUsed = false;
outLabelUsed = false;
initVarTypes();
out <<
" {\n"
" " << slenType << " _slen";
if ( redFsm->anyRegCurStateRef() )
out << ", _ps";
out <<
";\n"
" " << transType << " _trans";
if ( redFsm->anyConditions() )
out << ", _cond";
out << ";\n";
if ( redFsm->anyToStateActions() ||
redFsm->anyRegActions() || redFsm->anyFromStateActions() )
{
out <<
" " << actsType << " _acts;\n"
" " << nactsType << " _nacts;\n";
}
out <<
" " << "int _keys;\n"
" " << indsType << " _inds;\n";
/*
" " << PTR_CONST() << WIDE_ALPH_TYPE() << POINTER() << "_keys;\n"
" " << PTR_CONST() << ARRAY_TYPE(redFsm->maxIndex) << POINTER() << "_inds;\n";*/
if ( redFsm->anyConditions() ) {
out <<
" " << condsType << " _conds;\n"
" " << 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";
}
if ( redFsm->anyConditions() )
COND_TRANSLATE();
LOCATE_TRANS();
if ( redFsm->anyEofTrans() )
out << "_eof_trans:\n";
if ( redFsm->anyRegCurStateRef() )
out << " _ps = " << vCS() << ";\n";
out <<
" " << vCS() << " = " << TT() << "[_trans];\n"
"\n";
if ( redFsm->anyRegActions() ) {
out <<
" if ( " << TA() << "[_trans] == 0 )\n"
" goto _again;\n"
"\n"
" _acts = " << TA() << "[_trans];\n"
" _nacts = " << A() << "[_acts++];\n"
" while ( _nacts-- > 0 ) {\n"
" switch ( " << A() << "[_acts++] )\n {\n";
ACTION_SWITCH();
SWITCH_DEFAULT() <<
" }\n"
" }\n"
"\n";
}
if ( redFsm->anyRegActions() || redFsm->anyActionGotos() ||
redFsm->anyActionCalls() || redFsm->anyActionRets() )
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 <<
" 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 <<
" if ( " << ET() << "[" << vCS() << "] > 0 ) {\n"
" _trans = " << CAST(transType) << " (" << ET() <<
"[" << vCS() << "] - 1);\n"
" goto _eof_trans;\n"
" }\n";
}
if ( redFsm->anyEofActions() ) {
out <<
" " << PTR_CONST() << ARRAY_TYPE(redFsm->maxActArrItem) <<
POINTER() << "__acts = " <<
EA() << "[" << vCS() << "];\n"
" " << UINT() << " __nacts = " << CAST(UINT()) << " " <<
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";
}
void OCamlFFlatCodeGen::writeExec()
{
testEofUsed = false;
outLabelUsed = false;
initVarTypes();
out <<
L" begin\n";
// L" " << slenType << L" _slen";
// if ( redFsm->anyRegCurStateRef() )
// out << L", _ps";
// out << L";\n";
// out << L" " << transType << L" _trans";
// if ( redFsm->anyConditions() )
// out << L", _cond";
// out << L";\n";
// out <<
// L" " << L"int _keys;\n"
// L" " << indsType << L" _inds;\n";
/*
L" " << PTR_CONST() << WIDE_ALPH_TYPE() << POINTER() << L"_keys;\n"
L" " << PTR_CONST() << ARRAY_TYPE(redFsm->maxIndex) << POINTER() << L"_inds;\n";*/
out <<
L" let state = { keys = 0; trans = 0; } in\n"
L" let rec do_start () =\n";
// if ( redFsm->anyConditions() ) {
// out <<
// L" " << condsType << L" _conds;\n"
// L" " << WIDE_ALPH_TYPE() << L" _widec;\n";
// }
if ( !noEnd ) {
testEofUsed = true;
out <<
L" if " << P() << L" = " << PE() << L" then\n"
L" do_test_eof ()\n"
L"\telse\n";
}
if ( redFsm->errState != 0 ) {
outLabelUsed = true;
out <<
L" if " << vCS() << L" = " << redFsm->errState->id << L" then\n"
L" do_out ()\n"
L"\telse\n";
}
out << L"\tdo_resume ()\n";
out << L"and do_resume () =\n";
if ( redFsm->anyFromStateActions() ) {
out <<
L" begin match " << AT( FSA(), vCS() ) << L" with\n";
FROM_STATE_ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" end;\n"
L"\n";
}
if ( redFsm->anyConditions() )
COND_TRANSLATE();
out << L"\tbegin try\n";
LOCATE_TRANS();
out << L"\twith Goto_match -> () end;\n";
out << L"\tdo_eof_trans ()\n";
// if ( redFsm->anyEofTrans() )
out << L"and do_eof_trans () =\n";
if ( redFsm->anyRegCurStateRef() )
out << L" let ps = " << vCS() << L" in\n";
out <<
L" " << vCS() << L" <- " << AT( TT() ,L"state.trans" ) << L";\n"
L"\n";
if ( redFsm->anyRegActions() ) {
out <<
L" begin try if " << AT( TA() , L"state.trans" ) << L" = 0 then\n"
L" raise Goto_again;\n"
L"\n"
L" match " << AT( TA(), L"state.trans" ) << L" with\n";
ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" with Goto_again -> () end;\n"
L"\n";
}
out << L"\tdo_again ()\n";
// if ( redFsm->anyRegActions() || redFsm->anyActionGotos() ||
// redFsm->anyActionCalls() || redFsm->anyActionRets() )
out << L"\tand do_again () =\n";
if ( redFsm->anyToStateActions() ) {
out <<
L" begin match " << AT( TSA(), vCS() ) << L" with\n";
TO_STATE_ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" end;\n"
L"\n";
}
if ( redFsm->errState != 0 ) {
outLabelUsed = true;
out <<
L" match " << vCS() << L" with\n"
L"\t| " << redFsm->errState->id << L" -> do_out ()\n"
L"\t| _ ->\n";
}
out << L"\t" << P() << L" <- " << P() << L" + 1;\n";
if ( !noEnd ) {
out <<
L" if " << P() << L" <> " << PE() << L" then\n"
L" do_resume ()\n"
L"\telse do_test_eof ()\n";
}
else {
out <<
L" do_resume ()\n";
}
// if ( testEofUsed )
out << L"and do_test_eof () =\n";
if ( redFsm->anyEofTrans() || redFsm->anyEofActions() ) {
out <<
L" if " << P() << L" = " << vEOF() << L" then\n"
L" begin try\n";
if ( redFsm->anyEofTrans() ) {
out <<
L" if " << AT( ET(), vCS() ) << L" > 0 then\n"
L" begin\n"
L" state.trans <- " << CAST(transType) << L"(" << AT( ET(), vCS() ) << L" - 1);\n"
L" raise Goto_eof_trans;\n"
L" end;\n";
}
if ( redFsm->anyEofActions() ) {
out <<
L" begin match " << AT( EA(), vCS() ) << L" with\n";
EOF_ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" end\n";
}
out <<
L" with Goto_again -> do_again ()\n"
L" | Goto_eof_trans -> do_eof_trans () end\n"
L"\n";
}
else
{
out << L"\t()\n";
}
if ( outLabelUsed )
out << L" and do_out () = ()\n";
out << L"\tin do_start ()\n";
out << L" end;\n";
}
void CSharpTabCodeGen::writeExec()
{
testEofUsed = false;
outLabelUsed = false;
initVarTypes();
out <<
L" {\n"
L" " << klenType << L" _klen";
if ( redFsm->anyRegCurStateRef() )
out << L", _ps";
out <<
L";\n"
L" " << transType << L" _trans;\n";
if ( redFsm->anyConditions() )
out << L" " << WIDE_ALPH_TYPE() << L" _widec;\n";
if ( redFsm->anyToStateActions() || redFsm->anyRegActions()
|| redFsm->anyFromStateActions() )
{
out <<
L" int _acts;\n"
L" int _nacts;\n";
}
out <<
L" " << keysType << L" _keys;\n"
L"\n";
// L" " << PTR_CONST() << WIDE_ALPH_TYPE() << POINTER() << L"_keys;\n"
if ( !noEnd ) {
testEofUsed = true;
out <<
L" if ( " << P() << L" == " << PE() << L" )\n"
L" goto _test_eof;\n";
}
if ( redFsm->errState != 0 ) {
outLabelUsed = true;
out <<
L" if ( " << vCS() << L" == " << redFsm->errState->id << L" )\n"
L" goto _out;\n";
}
out << L"_resume:\n";
if ( redFsm->anyFromStateActions() ) {
out <<
L" _acts = " << FSA() << L"[" + vCS() + L"]" << L";\n"
L" _nacts = " << A() << L"[_acts++];\n"
L" while ( _nacts-- > 0 ) {\n"
L" switch ( " << A() << L"[_acts++] ) {\n";
FROM_STATE_ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" }\n"
L" }\n"
L"\n";
}
if ( redFsm->anyConditions() )
COND_TRANSLATE();
LOCATE_TRANS();
out << L"_match:\n";
if ( useIndicies )
out << L" _trans = " << CAST(transType) << I() << L"[_trans];\n";
if ( redFsm->anyEofTrans() )
out << L"_eof_trans:\n";
if ( redFsm->anyRegCurStateRef() )
out << L" _ps = " << vCS() << L";\n";
out <<
L" " << vCS() << L" = " << TT() << L"[_trans];\n"
L"\n";
if ( redFsm->anyRegActions() ) {
out <<
L" if ( " << TA() << L"[_trans] == 0 )\n"
L" goto _again;\n"
L"\n"
L" _acts = " << TA() << L"[_trans]" << L";\n"
L" _nacts = " << A() << L"[_acts++];\n"
L" while ( _nacts-- > 0 )\n {\n"
L" switch ( " << A() << L"[_acts++] )\n {\n";
ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" }\n"
L" }\n"
L"\n";
}
if ( redFsm->anyRegActions() || redFsm->anyActionGotos() ||
redFsm->anyActionCalls() || redFsm->anyActionRets() )
out << L"_again:\n";
if ( redFsm->anyToStateActions() ) {
out <<
L" _acts = " << TSA() << L"[" << vCS() << L"]" << L";\n"
L" _nacts = " << A() << L"[_acts++];\n"
L" while ( _nacts-- > 0 ) {\n"
L" switch ( " << A() << L"[_acts++] ) {\n";
TO_STATE_ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" }\n"
L" }\n"
L"\n";
}
if ( redFsm->errState != 0 ) {
outLabelUsed = true;
out <<
L" if ( " << vCS() << L" == " << redFsm->errState->id << L" )\n"
L" goto _out;\n";
}
if ( !noEnd ) {
out <<
L" if ( ++" << P() << L" != " << PE() << L" )\n"
L" goto _resume;\n";
}
else {
out <<
L" " << P() << L" += 1;\n"
L" goto _resume;\n";
}
if ( testEofUsed )
out << L" _test_eof: {}\n";
if ( redFsm->anyEofTrans() || redFsm->anyEofActions() ) {
out <<
L" if ( " << P() << L" == " << vEOF() << L" )\n"
L" {\n";
if ( redFsm->anyEofTrans() ) {
out <<
L" if ( " << ET() << L"[" << vCS() << L"] > 0 ) {\n"
L" _trans = " << CAST(transType) << L" (" << ET() <<
L"[" << vCS() << L"] - 1);\n"
L" goto _eof_trans;\n"
L" }\n";
}
if ( redFsm->anyEofActions() ) {
out <<
L" int __acts = " <<
EA() << L"[" << vCS() << L"]" << L";\n"
L" int __nacts = " <<
A() << L"[__acts++];\n"
L" while ( __nacts-- > 0 ) {\n"
L" switch ( " << A() << L"[__acts++] ) {\n";
EOF_ACTION_SWITCH();
SWITCH_DEFAULT() <<
L" }\n"
L" }\n";
}
out <<
L" }\n"
L"\n";
}
if ( outLabelUsed )
out << L" _out: {}\n";
out << L" }\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) << L"if ( " << GET_KEY() << L" < " <<
KEY(data[mid]->lowKey) << L" ) {\n";
emitCondBSearch( state, level+1, low, mid-1 );
out << TABS(level) << L"} else if ( " << GET_KEY() << L" > " <<
KEY(data[mid]->highKey) << L" ) {\n";
emitCondBSearch( state, level+1, mid+1, high );
out << TABS(level) << L"} else {\n";
COND_TRANSLATE(data[mid], level+1);
out << TABS(level) << L"}\n";
}
else if ( anyLower && !anyHigher ) {
/* Can go lower than mid but not higher. */
out << TABS(level) << L"if ( " << GET_KEY() << L" < " <<
KEY(data[mid]->lowKey) << L" ) {\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) << L"} else {\n";
COND_TRANSLATE(data[mid], level+1);
out << TABS(level) << L"}\n";
}
else {
out << TABS(level) << L"} else if ( " << GET_KEY() << L" <= " <<
KEY(data[mid]->highKey) << L" ) {\n";
COND_TRANSLATE(data[mid], level+1);
out << TABS(level) << L"}\n";
}
}
else if ( !anyLower && anyHigher ) {
/* Can go higher than mid but not lower. */
out << TABS(level) << L"if ( " << GET_KEY() << L" > " <<
KEY(data[mid]->highKey) << L" ) {\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) << L"} else {\n";
COND_TRANSLATE(data[mid], level+1);
out << TABS(level) << L"}\n";
}
else {
out << TABS(level) << L"} else if ( " << GET_KEY() << L" >= " <<
KEY(data[mid]->lowKey) << L" ) {\n";
COND_TRANSLATE(data[mid], level+1);
out << TABS(level) << L"}\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) << L"if ( " << KEY(data[mid]->lowKey) << L" <= " <<
GET_KEY() << L" && " << GET_KEY() << L" <= " <<
KEY(data[mid]->highKey) << L" ) {\n";
COND_TRANSLATE(data[mid], level+1);
out << TABS(level) << L"}\n";
}
else if ( limitLow && !limitHigh ) {
out << TABS(level) << L"if ( " << GET_KEY() << L" <= " <<
KEY(data[mid]->highKey) << L" ) {\n";
COND_TRANSLATE(data[mid], level+1);
out << TABS(level) << L"}\n";
}
else if ( !limitLow && limitHigh ) {
out << TABS(level) << L"if ( " << KEY(data[mid]->lowKey) << L" <= " <<
GET_KEY() << L" )\n {";
COND_TRANSLATE(data[mid], level+1);
out << TABS(level) << L"}\n";
}
else {
/* Both high and low are at the limit. No tests to do. */
COND_TRANSLATE(data[mid], level);
}
}
}
void OCamlTabCodeGen::writeExec()
{
testEofUsed = false;
outLabelUsed = false;
initVarTypes();
out <<
" begin\n";
// " " << klenType << " _klen";
// if ( redFsm->anyRegCurStateRef() )
// out << ", _ps";
/*
out << " " << transType << " _trans;\n";
if ( redFsm->anyConditions() )
out << " " << WIDE_ALPH_TYPE() << " _widec;\n";
if ( redFsm->anyToStateActions() || redFsm->anyRegActions()
|| redFsm->anyFromStateActions() )
{
out <<
" int _acts;\n"
" int _nacts;\n";
}
out <<
" " << keysType << " _keys;\n"
"\n";
// " " << PTR_CONST() << WIDE_ALPH_TYPE() << POINTER() << "_keys;\n"
*/
out <<
" let state = { keys = 0; trans = 0; acts = 0; nacts = 0; } in\n"
" let rec do_start () =\n";
if ( !noEnd ) {
testEofUsed = true;
out <<
" if " << P() << " = " << PE() << " then\n"
" do_test_eof ()\n"
"\telse\n";
}
if ( redFsm->errState != 0 ) {
outLabelUsed = true;
out <<
" if " << vCS() << " = " << redFsm->errState->id << " then\n"
" do_out ()\n"
"\telse\n";
}
out << "\tdo_resume ()\n";
out << "and do_resume () =\n";
if ( redFsm->anyFromStateActions() ) {
out <<
" state.acts <- " << AT( FSA(), vCS() ) << ";\n"
" state.nacts <- " << AT( A(), POST_INCR("state.acts") ) << ";\n"
" while " << POST_DECR("state.nacts") << " > 0 do\n"
" begin match " << AT( A(), POST_INCR("state.acts") ) << " with\n";
FROM_STATE_ACTION_SWITCH();
SWITCH_DEFAULT() <<
" end\n"
" done;\n"
"\n";
}
if ( redFsm->anyConditions() )
COND_TRANSLATE();
out << "\tbegin try\n";
LOCATE_TRANS();
out << "\twith Goto_match -> () end;\n";
out <<
"\tdo_match ()\n";
out << "and do_match () =\n";
if ( useIndicies )
out << " state.trans <- " << CAST(transType) << AT( I(), "state.trans" ) << ";\n";
out << "\tdo_eof_trans ()\n";
// if ( redFsm->anyEofTrans() )
out << "and do_eof_trans () =\n";
if ( redFsm->anyRegCurStateRef() )
out << " let ps = " << vCS() << " in\n";
out <<
" " << vCS() << " <- " << AT( TT() ,"state.trans" ) << ";\n"
"\n";
if ( redFsm->anyRegActions() ) {
out <<
"\tbegin try\n"
" match " << AT( TA(), "state.trans" ) << " with\n"
"\t| 0 -> raise Goto_again\n"
"\t| _ ->\n"
" state.acts <- " << AT( TA(), "state.trans" ) << ";\n"
" state.nacts <- " << AT( A(), POST_INCR("state.acts") ) << ";\n"
" while " << POST_DECR("state.nacts") << " > 0 do\n"
" begin match " << AT( A(), POST_INCR("state.acts") ) << " with\n";
ACTION_SWITCH();
SWITCH_DEFAULT() <<
" end;\n"
" done\n"
"\twith Goto_again -> () end;\n";
}
out << "\tdo_again ()\n";
// if ( redFsm->anyRegActions() || redFsm->anyActionGotos() ||
// redFsm->anyActionCalls() || redFsm->anyActionRets() )
out << "\tand do_again () =\n";
if ( redFsm->anyToStateActions() ) {
out <<
" state.acts <- " << AT( TSA(), vCS() ) << ";\n"
" state.nacts <- " << AT( A(), POST_INCR("state.acts") ) << ";\n"
" while " << POST_DECR("state.nacts") << " > 0 do\n"
" begin match " << AT( A(), POST_INCR("state.acts") ) << " with\n";
TO_STATE_ACTION_SWITCH();
SWITCH_DEFAULT() <<
" end\n"
" done;\n"
"\n";
}
if ( redFsm->errState != 0 ) {
outLabelUsed = true;
out <<
" match " << vCS() << " with\n"
"\t| " << redFsm->errState->id << " -> do_out ()\n"
"\t| _ ->\n";
}
out << "\t" << P() << " <- " << P() << " + 1;\n";
if ( !noEnd ) {
out <<
" if " << P() << " <> " << PE() << " then\n"
" do_resume ()\n"
"\telse do_test_eof ()\n";
}
else {
out <<
" do_resume ()\n";
}
// if ( testEofUsed )
out << "and do_test_eof () =\n";
if ( redFsm->anyEofTrans() || redFsm->anyEofActions() ) {
out <<
" if " << P() << " = " << vEOF() << " then\n"
" begin try\n";
if ( redFsm->anyEofTrans() ) {
out <<
" if " << AT( ET(), vCS() ) << " > 0 then\n"
" begin\n"
" state.trans <- " << CAST(transType) << "(" << AT( ET(), vCS() ) << " - 1);\n"
" raise Goto_eof_trans;\n"
" end\n";
}
if ( redFsm->anyEofActions() ) {
out <<
" let __acts = ref " << AT( EA(), vCS() ) << " in\n"
" let __nacts = ref " << AT( A(), "!__acts" ) << " in\n"
" incr __acts;\n"
" while !__nacts > 0 do\n"
" decr __nacts;\n"
" begin match " << AT( A(), POST_INCR("__acts.contents") ) << " with\n";
EOF_ACTION_SWITCH();
SWITCH_DEFAULT() <<
" end;\n"
" done\n";
}
out <<
" with Goto_again -> do_again ()\n"
" | Goto_eof_trans -> do_eof_trans () end\n"
"\n";
}
else
{
out << "\t()\n";
}
if ( outLabelUsed )
out << " and do_out () = ()\n";
out << "\tin do_start ()\n";
out << " end;\n";
}
