Consider the following program in a language that has dynamic scooping:

var x: real;
procedure show;
         begin print(x); end;
procedure small;
         var x: real;
             begin x: = 0.125; show; end;
begin x:=0.25;
         show; small
         end;

Then the output of the program is:

A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor?

Consider the regular expression $$(0+1)(0+1).......n$$ times. The minimum state finite automation that recognizes the language represented by this regular expression contains:

Context free languages are closed under: