Question

Consider the following C, C++, or Java assignment statement:

value = value * 10;

Assume that the variable value is declared and initialized.

What are some of the bindings and their binding times for parts of the above assignment statement? Use the following bullets listing style.

*

*

*

*

*

*

Write an example of Implicit heap dynamic variable in a selected programming language:

Write an example of Stack-dynamic variable in a selected programming language:

Answer 1

• The set of possible values of 'value' is bound at Compiler design time.
• The operator * is bound at compile time.
• 10 is bound at compiler design time.
• Value of 'value' is bound at run time

Stack Dynamic variables

- They are usually local variables of functions including arguments.

-When the declaration are elaborated storage bindings are created.

-When the function is called, local variables are allocated on run-time stack and variable is bound to address.

-When the function returns all the space is deallocated.

-The allocation and deallocation is done at runtime i.e., dynamically.

eg:

#include <iostream>

using namespace std;

sum(int num1, int num2)

{

int num3 = num1+num2;

return num3;

}

int main(){

cout<<sum(1,99);

return 0;

}

• num1 and num2 are static dynamic variable.

Implicit Heap Dynamic Variables

-Allocation and deallocation is caused by assignment statements.

-variables are bound to heap storage only when they are assigned values.

-Mainly used in scripting languages.

-All strings and arrays in Perl,PHP,JavaScript and; Lists in LISP and Scheme are examples.

eg:List in LISP

• (list 1 2 3 4 5)

                   o/p =>(1 2 3 4 5)

• (write(list 1 2))

                   o/p =>(1 2)