Use the following code to perform the following tasks: Show all variables that are visible at POSITION #1 only. Provide their nesting level and offset, using the activation record layout discussed in class.S2how the contents of the call stack at the time when control reaches POSITION #1. Use the layout defined in chapter 10 and used in class for statically scoped languages that allow nested functions. Show values and links. function main() { int w = 1, x = 2; function a(bool flag) { int x = 3; function b() { c(4); }

1. Use the following code to perform the following tasks:

   1. Show all variables that are visible at POSITION #1 only. Provide their nesting level and offset, using the activation record layout discussed in class.S2how the contents of the call stack at the time when control reaches POSITION #1. Use the layout defined in chapter 10 and used in class for statically scoped languages that allow nested functions. Show values and links.

function main() {
int w = 1, x = 2;

function a(bool flag) {
int x = 3;

function b() {

c(4);

}

function c(int x) {
// POSITION #1

}

b();

}

a(true);

}

1. Provide a leftmost derivation for the string aaabb using the following grammar:
   
   <S> → <A><B>

<A> → a<A> | a

<B> → b<B> | b

1. Identify the shortest possible legal program:

<program> → program <ident> ( <ident> { , <ident> } ) <block>

<ident> → A | B
<block> → begin <stmts> end

<stmts> → <ident> = <ident> | <block>

1. Show the following grammar is ambiguous:

<S> → <A><B>

<A> → xx<A> | ε

<B> → x<B> | x