What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size n?

Consider the following ANSI C program:

int main() {

Integer x;

return 0;

}

Which one of the following phases in a seven-phase C compiler will throw an error?  

In the context of compilers, which of the following is/are NOT an intermediate representation of the source program?

Consider the following augmented grammar with {#, @, <, >, a, b, c} as the set of terminals.

S' → S

S → S # cS

S → SS

S → S @

S → < S >

S → a

S → b

S → c

Let I0 = CLOSURE({S' → ∙ S}). The number of items in the set GOTO(GOTO(I0, <), <) is _______