1 2 3 10 12 13 14 15 16 17 18 19 Consider following pseudo-code, assuming dynamic scoping rules: procedure main () x:int := 1 y:int := 2 procedure sub () x := x - y print (x) procedure bar (f: procedure) x: int = 5 f () procedure foo () y:int := 3 bar (sub) // main body foo () print (x) 1. If the language uses deep binding, what will the output be? Explain your answer. 2. If the language uses shallow binding, what will the output be? Explain your answer.

The determination to make a context switch is based on which of the following? (Select all that apply.) O illegal operation O reboot timer O system call

Suppose we're modelling an RC crane which is receiving a sequence of input commands, each of which is UP, DOWN, or BEEP. This crane has only two vertical positions, and starts in the high position. It should go into an ERROR end state if it is asked to go UP when it is in the high position or DOWN when it is in the low position. Once it is in the ERROR state, it stays in the ERROR state no matter what commands it receives. BEEP commands are legal at any point. Give a state diagram for this system, in which each edge corresponds to receiving a single command.

Could you assist me with question 2.7 part B? I'm finding this problem quite challenging and would appreciate help with creating a state diagram for the push-down automaton related to part B. I started the problem shown in the photo but I don't know why it is incorrect, can you use the photo that I used.question for 2.7 2.7 Give informal English descriptions of PDAs for the language. B. The complement of the language {a^n b^n | n ≥ 0}