Indicate the following statement true or false :

A programming language not supporting either recursion or pointer type does not need the support of dynamic memory allocation.

Indicate the following statement true or false:

Although C does not support call by name parameter passing, the effect can be correctly simulated in C.

Which one of the following is the strongest correct statement about a finite language over some finite alphabet $$\sum ? $$

Let $$r = 1\,{\left( {1 + 0} \right)^ * },s = {11^ * }\,0$$ and $$\,t = {1^ * }\,0$$ be three regular expressions. Which one of the following is true?