Chapter 7, Problem 17PS

Can type checking be used while compiling a language with dynamic scoping? Why? Is type checking feasible in a static scoping language? Why?

Most statically typed languages developed since the 1970s (including Java, C#, and the descendants of Pascal) use some form of name equivalence for types. Is structural equivalence a bad idea? Why or why not?

Write a finite-difference representation for ??/??=0 and identify all variables (e.g., subscripts, superscripts, etc.) using, a. Explicit scheme. b. Implicit scheme.

Compare the advantages of early type binding in C and Java to the advantages of late type binding in languages such as JavaScript and python (type less languages). (Give short answer) Like for the correct answer.

a) We have seen different reduction strategies and evaluation forms in lambda calculusand in Haskell. What are the key points that you can summarise and how would youcomment on these different evaluation strategies, with reference to normalisation?b) Comment on the ways "typing" is handled in the theory (à-la-Church and à-la-Curry) incomparison to those you have seen in Haskell.

Explain difference between reference and value parameters in context of Java language

Write an EBNF rule that describes the for-statement of Java or C++. Write the recursive descent subprogram in Java or C++ for this rule.

What distinguishes automated type conversion from type casting? What are the type promotion rules in Java expressions?

How does C++ tell the difference between an overloaded prefix and postfix ++ or −− operator function?