The ability of a language to allow a small number of constructs to be combined freely without restrictions.

The type of semantics that describes how a program executes step-by-step.

The degree to which programs perform correctly and consistently under all circumstances.

What $$x:=x+1$$ represents in Operational Semantics if the initial state is S(x=5).

The process of associating a variable name with a memory location or value.

The type of semantics that uses Hoare Triples ( $$\{P\}$$ \text{statement} $$\{Q\}$$ ) to describe program correctness.

The concept that allows inner scopes to access variables from outer scopes, but not vice versa.

The specific component of an Activation Record that points to the caller's activation record.

The binding time for the meaning of the plus operator (+) as addition.

The type of typing where errors may appear only during runtime.

The degree to which a language allows programmers to express ideas or structures in code easily.

The logical assertion that must be true before the execution of a statement in Axiomatic Semantics.

The concept of an Activation Record that allows a function to return to the correct place after execution.

The characteristic of a language that determines if it allows implicit conversions between different data types.

The concept described by the phrase, "Variables declared inside a block shadow variables with the same name in outer scopes".

The total expense of using, developing, and maintaining code in a language.

The type of typing where variable types must be declared explicitly.

The type of semantics that describes what a program computes as a mathematical function.

Binding that happens before runtime, such as variable types in the C language.

The primary focus of Syntax in programming languages is:

A primary feature of high writability languages is:

In Operational Semantics, behavior is defined by changes in:

Python’s type system is:

Major contributor to a language’s Maintenance Cost:

Direction: Encircle or underline the correct answer. 26. Primary representation in Denotational Semantics:

Static (Lexical) Scoping means:

Handling exceptions gracefully increases:

Memory block created for a function call is:

Language less reliable due to pointers/manual memory:

In Hoare Triple {P} statement {Q}, correctness is guaranteed by:

Static typing advantage:

Dynamic (Late) Binding occurs at:

Direction: Encircle or underline the correct answer. 34. Global variable declared:

Real-life analogy for Operational Semantics:

Access Link points to:

Trade-off with high writability:

When two functions call each other recursively:

Expressivity feature improving writability:

In strongly typed languages, "5" + 2 results in:

Semantics defines the meaning or behavior of programs, while Syntax defines how programs are written (the form).

An advantage of Operational Semantics is that it abstracts away execution details, focusing only on the result.

In Denotational Semantics, the sequence of statements $$x:=3; y:=x+2;$$ is evaluated by applying the meaning of $$y:=x+2$$ first, then $$x:=3$$ .

Readability is considered less important than Writability because a program spends most of its life being executed by machines.

Simplicity is a factor that improves both Readability and Writability.

The Execution Cost of a language refers to the time and effort required to learn it.

A language with Weak Typing enforces strict type compatibility and results in more type errors.

In a language with Dynamic Typing, the type of a variable can change during runtime.

In static scoping, the compiler determines the scope from the code layout (lexical structure).

The Control Link in an Activation Record points to non-local variables.

Static (Early) Binding is generally associated with higher performance because decisions are made before runtime.

In the Hoare Triple $$ext{statement}$$ , the Postcondition $$Q$$ defines what must be true before execution.

The availability of clear and high-level data structures (like lists and dictionaries) improves a language's Readability.

Recursion requires the creation of multiple Activation Records for the same function on the runtime stack.

The total cost of a language includes only the time taken to design, code, and debug (Development Cost).

Aliasing Control is a factor that reduces unintended side effects from shared references, thereby improving Reliability.

Dynamic Scoping is used in modern languages like Python and C++.

The expression $[\begin{matrix}x&=&x+1&](s)&=s[x\mapsto&s(x)+1\end{matrix}]$ is a representation used in Denotational Semantics.

A Local Scope variable declared inside a function is accessible anywhere in the program.

Improving one evaluation criterion (e.g., Readability) often requires a trade-off that reduces another (e.g., Control over the machine)

Direction: Fill in the missing part ({ ? }) for the assignment statement using the Assignment Axiom of Axiomatic Semantics.

No. 61-62
Precondition (P): { ? }
Statement (v:=e): x := x + 5
Postcondition (Q): { x = 12 }
What is the missing precondition?

Direction: Fill in the missing part ({ ? }) for the assignment statement using the Assignment Axiom of Axiomatic Semantics.

No. 63-64
Precondition (P): { y = 3 }
Statement (v:=e): y := y * 4
Postcondition (Q): { ? }
What is the missing postcondition?

Direction: Fill in the missing part ({ ? }) for the assignment statement using the Assignment Axiom of Axiomatic Semantics.

No. 65-66
Precondition (P): { a = 9 }
Statement (v:=e): { ? }
Postcondition (Q): { a = 1 }
What is the missing statement?

Direction: Fill in the missing part ({ ? }) for the assignment statement using the Assignment Axiom of Axiomatic Semantics.

No. 67-68
Statement (v:=e): z := z - 3
Postcondition (Q): { z < 5 }
What is the missing precondition?

Direction: Fill in the missing part ({ ? }) for the assignment statement using the Assignment Axiom of Axiomatic Semantics.

No. 69-70
Precondition (P): { p = 10 }
Statement (v:=e): p := p / 2
Postcondition (Q): { ? }
What is the missing postcondition?

Direction: Fill in the missing part ({ ? }) for the assignment statement using the Assignment Axiom of Axiomatic Semantics.

No. 71-72
Precondition (P): { b = 2 }
Statement (v:=e): { ? }
Postcondition (Q): { b = 16 }
What is the missing statement?

Direction: Fill in the missing part ({ ? }) for the assignment statement using the Assignment Axiom of Axiomatic Semantics.

No. 73-74
Precondition (P): { ? }
Statement (v:=e): c := d
Postcondition (Q): { c = 20 }
What is the missing precondition?

Direction: Fill in the missing part ({ ? }) for the assignment statement using the Assignment Axiom of Axiomatic Semantics.

No. 75-76
Precondition (P): { x > 0 }
Statement (v:=e): x := x + 1
Postcondition (Q): { ? }
What is the missing postcondition?

Direction: Fill in the missing part ({ ? }) for the assignment statement using the Assignment Axiom of Axiomatic Semantics.

No. 77-78
Precondition (P): { k = 5 }
Statement (v:=e): { ? }
Postcondition (Q): { k = 5 }
What is the missing statement?

Direction: Fill in the missing part ({ ? }) for the assignment statement using the Assignment Axiom of Axiomatic Semantics.

No. 79-80
Statement (v:=e): m := 2
Postcondition (Q): { m != 3 }
What is the missing precondition?