CSE 3302 Exam 3

Bindings can be

Both implicit and explicit

Static, Dynamic and automatic are examples for what?

Storage class

"Colorless green ideas sleep furiously"

A sentence composed by Noam Chomsky in 1957 as an example of a sentence whose grammar is correct but whose meaning is nonsensical. It was used to show inadequacy of the then-popular probabilistic models of grammar, and the need for more structured models

Constructs derivations and parse trees from the leaves to the roots

Bottom-up parser

The parsing phase is the phase in which a compiler processes the tokens, determining the program's syntactic structure.

True

A symbol table must support which of the following operations regarding the bindings of names to attributes

Insertion, Lookup, Deletion (All of the above)

Allocations on the heap is

Dynamic

What represents the entire top-level phase being defined in a grammar

Start symbol

Representation of characters or digits

Literal

Symbols used to describe the grammar rules

Metasymbols

In class, we covered the two concepts that required to define a data type, what are those two concepts

Valid value, Valid operations

When a function's name is overloaded, the name resolution can be determined based upon the only type of parameters

False

A language in which tokens must occur in prespecified locations on the line or page is considered to be what?

Fixed format

The graphical description of the replacement process in a derivation of a grammar is

Parse tree

This can have its values corrupted at local times

Static constant

What translate an entire program into executable code and does not execute it

Compiler

Why is it important for a language to recognize two data types as being distinctly different?

Operation might not get executed

What are the ways to specify semantics?

Formal definition, Language reference manual

Those types supplied with a language, from which all other types are constructed

Predefined types

What the language constructs actually do

Semantics

A type that uses itself in its declaration is

Recursive

Formatting that affects the way tokens are recognized

Token delimiter

The process a translator goes through to determine whether type information in a program is consistent

Type checking

When grammar allows two distinct parse or syntax trees it is called what?

Ambiguous

Static binding occurs ____ execution

Before

The symbol table binds names to values

False

The stack and the heaps are the only places an allocation location for a variable may exist

False

Operators in expression are semantically different from function calls

False

Immutable objects never change state

True

Dynamic binding happens before execution

False

Operators in expressions are semantically different from function calls

False

Evaluate the RPN, 15 7 1 1 + - / 3 * 2 1 1 + + -

5