test Flashcards
(119 cards)
1
Q
A general-purpose, object-oriented
programming language. It supports both
static and dynamic typing
A
COBRA
2
Q
FORTRAN is a programming language
intended for numerical computations. (T/F)
A
TRUE
3
Q
An interpreter, like a compiler, translates
high-level language into low-level machine
language (T/F)
A
TRUE
4
Q
A general-purpose, imperative programming
language that is especially suited to numeric
computation and scientific computing
A
FORTRAN
5
Q
FORTRAN is originally developed by IBM
in the 1950s for scientific and engineering
applications. (T/F)
A
TRUE
6
Q
ALGOL 69 (short for ALGOrithmic
Language 1969) is an imperative computer
programming language that was conceived
as a successor to the ALGOL 60
programming language (T/F)
A
FALSE, ALGOL 68
7
Q
The output of an assembler is called an
object file, which contains a combination of
machine instructions as well as the data
required to place these instructions in
memory. (T/F)
A
TRUE
8
Q
The Common Lisp (CL) is a dialect of the
Lisp programming language, published in
ANSI standard document. (T/F)
A
TRUE
9
Q
The Lexical Analyzer removes spaces and
other unnecessary things like comments. (T/F)
A
TRUE
10
Q
The __________ looks for compiler
directives and removes the comments and
white space.
A
PREPROCESSOR
11
Q
The Intermediate form (IF) done after
semantic analysis. (T/F)
A
TRUE
12
Q
The Intermediate Form (IFs) are often
chosen for machine independence, ease of
optimization, or compactness. (T/F)
A
TRUE
13
Q
The preprocessor deletes portions of code,
which allows several versions of a program
to be built from the same source (T/F)
A
TRUE
14
Q
Scanning divides the program into “tokens”,
which are the smallest meaningful units; this
saves time, since character-by-character
processing is slow (T/F)
A
TRUE
15
Q
If an error occurs, an interpreter stops
execution and reports it; whereas a compiler
reads the whole program even if it
encounters several errors. (T/F)
A
TRUE
16
Q
A modern programming language designed
for large, long-lived applications – and
embedded systems in particular – where
reliability and efficiency are essential.
A
ADA
17
Q
The minor task of a linker is to search and
locate referenced module/routines in a
program (T/F)
A
FALSE, MAJOR TASK
18
Q
The compiler is the point of control during
execution (T/F)
A
FALSE, INTERPRETER
19
Q
What is the Language developed for backing
of a powerful sponsor?
A
COBOL
20
Q
In parsing it finds the structure you can
describe with syntax diagrams. (T/F)
A
TRUE
21
Q
Most language implementations include a
mixture of both compilation and
interpretation. (T/F)
A
TRUE
22
Q
The Java language definition defines a
machine-independent intermediate form
known as byte code. (T/F)
A
TRUE
23
Q
Parsing is recognition of a context-free
language. (T/F)
A
TRUE
24
Q
The compilation does NOT have to produce
machine language for some sort of
hardware (T/F)
A
TRUE
25
Compilation is translation from one
language into another, with full analysis of
the meaning of the input. (T/F)
TRUE
26
The interpretation allows greater flexibility
while Compilation use for better
performance. (T/F)
TRUE
27
Assembly-level instruction set is not
implemented in hardware; it runs on an
interpreter. (T/F)
TRUE
28
The language is intended for the way of
thinking and way of expressing algorithms (T/F)
TRUE
29
What language is possible to compile to
very good (fast/small) code?
FORTRAN
30
The ML is a general-purpose functional
programming language developed by Robin
Milner and others in the early 1970s at the
University of Edinburgh. ML stands for
MetaLanguage. (T/F)
TRUE
31
Algol 68 is a functional programming
language and one of the two main dialects of
the programming language Lisp. (T/F)
FALSE, SCHEME
32
A programming language conceived as a
successor to an upgraded version of Modula
2 known as Modula-2+.
MODULA 3
33
An imperative and procedural programming
language, which NiklausLinks to an external
site. WirthLinks to an external site.designed
in 1968–69 and published in 1970.
PASCAL
34
An Interpreter reads the whole source code
at once, creates tokens, checks semantics,
generates intermediate code, executes the
whole program and may involve many
passes. (T/F)
FALSE, COMPILER
35
A computer program that links and merges
various object files together in order to make
an executable file.
LINKER
36
The recursive rules known as parsing define
the ways in which these constituents
combine. (T/F)
FALSE, CONTEXT
FREE GRAMMAR
37
The ________code is the standard format
for distribution of Java programs.
BYTE
38
The term parsing is part of the recognition of
a regular language. (T/F)
FALSE,
SCANNING* PARSING IS CONTEXT
FREE LANGUAGE
39
In C programming language , help you
understand unions, arrays & pointers,
separate compilation, var args, catch and
throw.(T/F)
TRUE
40
The main C# compiler produces .NET
Common Intermediate Language (CIL),
which is then translated into machine code
immediately prior to execution. (T/F)
TRUE
41
A compiler hides further steps; a pre
processor does not hide steps. (T/F)
TRUE
42
The compiler merely produces the machine
language instructions that correspond to the
source code file that was compiled. (T/F)
TRUE
43
The __________ takes an intermediate-code
program and produces another one that does
the same thing faster, or in less space.
OPTIMIZATION
44
A preprocessor is generally considered as a
part of compiler, is a tool that produces
input for compilers. (T/F)
TRUE
45
A program that converts high-level
language to assembly language
Compiler
46
Compilation entails semantic understanding
of what is being processed (T/F)
TRUE
47
Interpreter is written in low-level
instructions. (T/F)
TRUE
48
An assembler translates assembly language
programs into machine code. (T/F)
TRUE
49
The parsing organizes tokens into a parse
tree that represents higher-level constructs in
terms of their constituents. (T/F)
TRUE
50
The main C language compiler
produces .NET Common Intermediate
Language (CIL), which is then translated
into machine code immediately prior to
execution. (T/F)
FALSE, C#
51
The __________Analyzer breaks the
sentence into tokens.
Linear
52
A program that converts the assembly
language to machine-level language.
ASSEMBLER
53
One of the major roles of the parser is not to
produce an intermediate representation (IR)
of the source program using syntax-directed
translation methods.(T/F)
FALSE, IS TO PRODUCE
54
A ___________is a logical unit with respect
to the rules of the source language.
PHRASE
55
A syntax analyzer or parser is a program that
groups sequences of tokens from the lexical
analysis phase into phrases each with an
associated phrase type. (T/F)
TRUE
56
A type of error about name of some
identifier typed incorrectly.
LEXICAL
57
It is not expected from the parser to check
for errors but errors may be encountered at
various stages of the compilation process.
(T/F)
TRUE
58
A syntax analyzer or parser takes the input
from a lexical analyzer in the form of token
streams. (T/F)
TRUE
59
In error recovery choose a minimal sequence
of changes to obtain a global least- cost
correction. (T/F)
TRUE
60
It is not important to detect errors as soon as
possible without further consuming
unnecessary input. (T/F)
FALSE, IT IS IMPORTANT
61
The grammar designers have to be careful
here because one wrong correction may lead
to an infinite loop. (T/F)
FALSE,
PARSER DESIGNERS
62
In panic mode, when a parser encounters an
error anywhere in the statement, it ignores
the rest of the statement by not processing
input from erroneous input to delimiter, such
as semi-colon. (T/F)
TRUE
63
The Dynamic semantic errors: hard or
impossible to detect at compile time,
runtime checks are required. (T/F)
TRUE
64
In the statement mode, When parser
encounters an error anywhere in the
statement, it ignores the rest of the statement
by not processing input from erroneous
input to delimiter, such as semi-colon. (T/F)
FALSE, PANIC MODE
65
A parser should be able to detect and report
any error in the program. (T/F)
TRUE
66
A grammar is a set of strings over an
alphabet. (T/F)
FALSE, LANGUAGE
67
Error production: Some common errors are
known to the compiler designers that may
occur in the code. (T/F)
TRUE
68
In verifying the validity of expressions in
Lexical Analysis, a well-accepted solution is
to use finite automata for verification. (T/F)
TRUE
69
In Finite Automata, Vertices – represents the
states and ________ – represents transitions.
EDGES
70
The pattern is the rule describing how a
token can be formed. (T/F)
TRUE
71
The parser analyzes the ____________(token stream) against the production rules to detect any errors in the
code.
Source Code
72
Lexical analyzer does not have to be an
individual phase. But having a separate
phase simplifies the design and improves the
efficiency and portability. (T/F)
TRUE
73
According to handling errors, the logical
errors: hard or impossible to detect. (T/F)
TRUE
74
In handling errors, the ______________ :
most important for compiler, can almost
always recover.
SYNTAX ERRORS
75
The parser considers the program in hand as
a whole and tries to figure out what the
program is intended to do and tries to find
out a closest match for it, which is error
free. (T/F)
TRUE
76
The Lexical analyzer: reads input characters
and produces a sequence of tokens as output. (T/F)
TRUE
77
A type of error about some missing
semicolon or unbalanced parenthesis.
SYNTACTICAL
78
Type of mode which is the easiest way of
error-recovery and also, it prevents the
parser from developing infinite loops.
PANIC MODE
79
A lexical analyzer, or ______ for short, will
as its input take a string of individual letters
and divide this string into tokens.
LEXER
80
A type of error about the incompatible value
assignment.
SEMANTICAL
81
An expression can be the sum of two
expressions, or the product of two
expressions, or a parenthesized
subexpression. (T/F)
TRUE
82
___________It is defined as the grammar in
each programming language.
SYNTAX
83
In syntax analysis, a parser is not required to
detect and report any error in the program.
FALSE, A PARSER SHOULD BE ABLE TO
84
Parsers use error recovering strategies. (T/F)
TRUE
85
There are a number of algebraic laws that
are obeyed by regular expressions, which
can be used to manipulate regular
expressions into equivalent forms.
TRUE
86
In Notation, the Union: (r)(s) is a regular
expression denoting L(r)L(s). (T/F)
FALSE, CONCATENATION
87
The grammar defined by regular expressions
is known as regular grammar. (T/F)
TRUE
88
Expression:
a := x * y + z
After lexical analysis, this statement has the
structure:
id1 assign id2 binop1 id3 binop2 id4
TRUE
89
A program may have the following kinds of
errors at various stages: Lexical, Syntactical,
Semantical and the ______________.
LOGICAL
90
It is expected that when an error is
encountered, the parser should be able to
handle it and carry on parsing the rest of the
input. (T/F)
TRUE
91
Tokens are specified by regular expressions.
TRUE
92
String: a group of characters having a
collective meaning. (T/F)
FALSE,
TOKENS
93
The generated lexers are in a class of
extremely simple programs called
________________.
FINITE
AUTOMATA
94
The word ______________in terms of
programming languages, words are objects
like variable names, numbers, keywords.
Lexical
95
In Notation, Union : (r)|(s) is a regular
expression denoting L(r) U L(s). (T/F)
TRUE
96
A __________ over an alphabet is a finite
sequence of symbols drawn from that
alphabet.
string
97
A __________is a group of characters
having a collective meaning.
TOKEN
98
The regular expressions have the capability
to express finite languages by defining a
pattern for finite strings of symbols. (T/F)
True
99
The regular expression is a set of rules that
say how to build a tree—a parse tree. (T/F)
FALSE
100
In error handling, the lexical errors state:
important, compiler can easily recover and
continue. (T/F)
TRUE
101
The viable-prefix property of parsers allows
early detection of syntax errors. (T/F)
TRUE
102
The lexical analyzer filters out whatever
separates the tokens, lay-out characters and
comments. (T/F)
TRUE
103
The language defined by regular grammar is
known as Irregular language. (T/F)
TRUE
104
Finite automata is a not recognizer for
regular expressions. (T/F)
FALSE, IS A RECOGNIZER
105
The regular expressions is an algebraic
notation for describing sets of strings. (T/F)
TRUE
106
A __________ over an alphabet is a finite
sequence of symbols drawn from that
alphabet.
STRING
107
The grammar defined by regular expressions
is known as regular grammar. (T/F0
TRUE
108
The interpreter does what is called STATIC
semantic analysis. (T/F)
FALSE, THE COMPILER
109
The interpreter stays around for the
execution of the program. (T/F)
TRUE
110
The term ___________refers to the
processing of source code files (.c, .cc,
or .cpp) and the creation of an 'object' file.
COMPILATION
111
The Lexcial Analyzer removes spaces and
other unnecessary things like comments. (T/F)
TRUE
112
A lexeme is a particular instant of a token. (T/F)
TRUE
113
The Semantic analyzer: reads input
characters and produces a sequence of
tokens as output. (T/F)
FALSE, LEXICAL ANALYZER
114
_____________is a state machine that takes
a string of symbols as input and changes its
state accordingly
FINITE AUTOMATA
115
According to handling errors, the lexical
errors: important, can sometimes recover.
(T/F)
FALSE (static semantic errors)
116
The Union of two languages L and M is
written as L U M = {s | s is in L or s is in
M} (T/F)
TRUE
117
The run time happens during which a
program executes. (T/F)
TRUE
118
The __________ allows variables to be
accessed globally and no guaranteed
efficient use of space, memory may become
fragmented over time as blocks of memory
are allocated.
HEAP
119
