TOPL FINALS EXAM

What is the form or structure of the expressions, statements, and program units
Syntax
Semantics
Language
Lexeme
What is the meaning of the expressions, statements, and program units
Syntax
Semantics
Language
Sentence
It is a string of characters over some alphabet
Sentence
Language
Lexeme
Token
It is a set of sentences
Sentence
Language
Lexeme
Token
It is the lowest level syntactic unit of a language
Sentence
Language
Lexeme
Token
It is a category of lexemes
Sentence
Language
Lexeme
Token
A recognition device reads input strings over the alphabet of the language and decides whether the input strings belong to the language
Recognizers
Generators
Grammar
Syntax
A device that generates sentences of a language
Recognizers
Generators
Grammar
Syntax
It is invented by John Backus to describe Algol 58
Backus-Naur Form
Context-Free Grammars
Recognizers
Generators
It is a metalanguage used to describe the syntax of language
Backus-Naur Form
Context-Free Grammars
Recognizers
Generators
It is not a language generator or a recognizer in itself
Backus-Naur Form
Context-Free Grammars
Recognizers
Generators
________ Grammars can be used to generate and recognize strings in a language
Backus-Naur Form
Context-Free Grammars
Recognizers
Generators
It is developed by Noam Chomsky in the mid-1950's
Backus-Naur Form
Context-Free Grammars
Recognizers
Generators
It is of language generators, meant to describe the syntax of natural languages
Backus-Naur Form
Context-Free Grammars
Recognizers
Generators
It define a class of languages called context-free languages
Backus-Naur Form
Context-Free Grammars
Recognizers
Generators
It is a process to check if a given sentence is a part of the grammar
Derivation
Grammar
Recognizers
Generators
A grammar is _______ if and only if it generates a sentence that has two or more distinct parse trees
Ambiguous
Grammar
Ambiguity
Correct
These are Imperative languages are abstractions of von Neumann architecture (pick 2)
Left Most Derivation
Right Most Derivation
Memory
Processor
To design a type, must consider scope, lifetime, type checking, initialization, and type compatibility
True
False
To design a type, must NOT consider scope, lifetime, type checking, initialization, and type compatibility
True
False
It is a design issue for Names
Common words are reserved words or keywords
Names being case sensitive
If too long, they cannot be connotative
Has a limit
It is a design issue for Names
Special words are reserved words or keywords
Names being case insensitive
If too long, they cannot be connotative
Has a limit
It is a design issue for Names
Common words are reserved words or keywords
Names being case insensitive
If too short, they cannot be connotative
Has a limit
It is a design issue for Names
Common words are reserved words or keywords
Names being case insensitive
If too long, they cannot be connotative
Has no limits
It is a design issue for Names
Common words are reserved words or keywords
Names being case insensitive
If too long, they cannot be connotative
Has no limits
It has a design issue for name length of 'maximum of 31'
FORTRAN 95
C99
C#
C++
It has a design issue for name length of 'no limit but only the first 63 are significant; also, external names are limited to a maximum of 31'
FORTRAN 95
C99
C#
C++
It has a design issue for name length of 'implementers often impose one'
FORTRAN 95
C99
C#
C++
It has a design issue for name special characters of 'all variable names must begin with dollar signs'
PHP
Perl
Ruby
C++
It has a design issue for name special characters of 'all variable names begin with special characters, which specify the variable’s type'
PHP
Perl
Ruby
C++
It has a design issue for name special characters of 'variable names that begin with @ are instance variables; those that begin with @@ are class variables'
PHP
Perl
Ruby
C++
It has a design issue for name case sensitivity of 'predefined names are mixed case'
PHP
Perl
Ruby
C++
It has a design issue for name special words of having '300 reserved words'
FORTRAN 95
Perl
Ruby
COBOL
This disadvantage is about readability where names that look alike are different
Case Sensitivity
Special Words
Special Characters
Length
This disadvantage is about readability where used to delimit or separate statement clauses
Case Sensitivity
Special Words
Special Characters
Length
This disadvantage is where if it's too short, they cannot be connotative
Case Sensitivity
Special Words
Special Characters
Length
It is an abstraction of a memory cell
Variable
Name
Address
Value
Not all variables have them
Variable
Name
Address
Value
The memory address with which it is associated
Variable
Name
Address
Value
Determines the range of values of variables and the set of operations that are defined for values of that type; in the case of floating point, type also determines the precision
Abstract memory cell
Name
Address
Type
The contents of the location with which the variable is associated
Abstract memory cell
Value
Variable
Type
It is of a variable is its address
L-Value
R-Value
Left Most Derivative
Right Most Derivative
It is of a variable is its value
L-Value
R-Value
Left Most Derivative
Right Most Derivative
It is the physical cell or collection of cells associated with a variable
Abstract memory cell
Value
Variable
Type
It is an association, such as between an attribute and an entity, or between an operation and a symbol
Abstract memory cell
Binding
Variable
Binding Time
It is the time at which a binding takes place
Abstract memory cell
Binding
Variable
Binding Time
It is the possible binding time at which bind operator symbols to operations
Language Design Time
Language Implementation Time
Compile Time
Load Time
It is the possible binding time at which bind floating point type to a representation
Language Design Time
Language Implementation Time
Compile Time
Load Time
It is the possible binding time at which bind a variable to a type in C or Java
Language Design Time
Language Implementation Time
Compile Time
Load Time
It is the possible binding time at which bind a C or C++ static variable to a memory cell
Language Design Time
Language Implementation Time
Compile Time
Load Time
It is the possible binding time at which bind a nonstatic local variable to a memory cell
Language Design Time
Runtime
Load Time
Dynamic
The binding is ____ is if it first occurs before run time and remains unchanged throughout program execution.
Static
Runtime
Load Time
Dynamic
The binding is ____ if it first occurs during execution or can change during execution of the program
Static
Runtime
Load Time
Dynamic
{"name":"TOPL FINALS EXAM", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"What is the form or structure of the expressions, statements, and program units, What is the meaning of the expressions, statements, and program units, It is a string of characters over some alphabet","img":"https://www.quiz-maker.com/3012/images/ogquiz.png"}
Powered by: Quiz Maker