复杂的尾递归情况

Question

Is it possible for the compiler to recognize tail-recursion in cases such as this?

void f(int x) {
    if (x == 1) {
        /* do_1... */
    }
    else if (x == 2) {
        /* do_2... */
    }
    else if (x == 3) { // here, we want do_2 and do_3; the order doesn't matter
        /* do_3... */
        f(2); // this should be tail recursive
    }
    else if (x == 4) {
        /* do_4... */
    }
}

Would placing a return; after f(2); help the compiler recognize it as a tail-recursion case?

Answer 1

识别出尾部调用优化机会的编译器在该特定用例中应该毫不费力地识别出它。