10571058105910601061106210631064106510661067
return !head ? RECURSION_EXIST : RECURSION_INFINITE; // throw exception here ??? } else { en.setMark2(); r = subexpInfRecursiveCheck(en.target, head); en.clearMark2(); } break; default: break;
11561157115811591160116111621163116411651166
} else if (en.isMark1()) { return 1; /* recursion */ } else { en.setMark2(); r = subexpRecursiveCheck(en.target); en.clearMark2(); } break; default: break;