FA 1 & 2 Flashcards
(118 cards)
1
Q
An assembler translates assembly language programs into machine code.
Group of answer choices
True
False
A
True
2
Q
The interpreter stays around for the execution of the program.
Group of answer choices
True
False
A
True
3
Q
The Common Lisp (CL) is a dialect of the Lisp programming language, published in ANSI standard document.
Group of answer choices
True
False
A
True
4
Q
Algol 68 is a functional programming language and one of the two main dialects of the programming language Lisp.
Group of answer choices
True
False
A
False
5
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
Group of answer choices
True
False
A
False
6
Q
A program that converts high-level language to assembly language
Group of answer choices
COMPILER
INTERPRETER
TRANSLATOR
None of the Above
A
COMPILER
7
Q
A programming language conceived as a successor to an upgraded version of Modula-2 known as Modula-2+.
Group of answer choices
MODULA-3
FORTRAN
C LANGUAGE
None of the Above
A
MODULA-3
8
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.
Group of answer choices
True
False
A
True
9
Q
A compiler hides further steps; a pre-processor does not hide steps.
Group of answer choices
True
False
A
True
10
Q
The interpreter does what is called STATIC semantic analysis.
Group of answer choices
True
False
A
FALSE
11
Q
The interpreter can be figured out at compile time.
Group of answer choices
True
False
A
False
12
Q
The __________ looks for compiler directives and removes the comments and white space.
Group of answer choices
PREPROCESSOR
INTERPRETER
LEXICAL ANALYZER
None of the Above
A
PREPROCESSOR
13
Q
Most language implementations include a mixture of both compilation and interpretation.
Group of answer choices
True
False
A
True
14
Q
Scanning discovers the “context free” structure of the program.
Group of answer choices
True
False
A
False
(parsing)
15
Q
The main C language compiler produces .NET Common Intermediate Language (CIL), which is then translated into machine code immediately prior to execution.
Group of answer choices
True
False
A
False
16
Q
FORTRAN is originally developed by IBM in the 1950s for scientific and engineering applications.
Group of answer choices
True
False
A
True
17
Q
FORTRAN is a programming language intended for numerical computations.
Group of answer choices
True
False
A
t
18
Q
In MetaLanguage(ML), help you understand first-class functions/closures, streams, catch and throw, symbol internals.
Group of answer choices
True
False
A
False
19
Q
A computer program that links and merges various object files together in order to make an executable file.
Group of answer choices
LINKER
INTERPRETER
COMPILER
None of the Above
A
LINKER
20
Q
A general-purpose, object-oriented programming language. It supports both static and dynamic typing.
Group of answer choices
COBRA
MODULA-3
C LANGUAGE
None of the Above
A
COBRA
21
Q
The Intermediate form (IF) done after semantic analysis.
Group of answer choices
True
False
A
True
22
Q
Compilation entails semantic understanding of what is being processed.
Group of answer choices
True
False
A
True
23
Q
The recursive rules known as parsing define the ways in which these constituents combine.
Group of answer choices
True
False
A
False
24
Q
The compilation does NOT have to produce machine language for some sort of hardware.
Group of answer choices
True
False
A
True
25
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.
Group of answer choices
True
False
True
26
The compiler is the point of control during execution.
Group of answer choices
True
False
False
(interpreter)
27
An interpreter, like a compiler, translates high-level language into low-level machine language
Group of answer choices
True
False
True
28
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.
Group of answer choices
True
False
False
29
A programming language that is wide dissemination at minimal cost like Pascal and Java.
Group of answer choices
True
False
True
30
What is the Language developed for backing of a powerful sponsor?
Group of answer choices
COBOL
FORTRAN
PASCAL
None of the Above
COBOL
31
A preprocessor is generally considered as a part of compiler, is a tool that produces input for compilers.
Group of answer choices
True
False
True
32
The main C# compiler produces .NET Common Intermediate Language (CIL), which is then translated into machine code immediately prior to execution.
Group of answer choices
True
False
True
33
The __________Analyzer breaks the sentence into tokens.
Group of answer choices
LINEAR
SEMANTIC
SYNTAX
None of the Above
LINEAR
34
Interpreter is written in low-level instructions.
Group of answer choices
True
False
True
35
The __________ takes an intermediate-code program and produces another one that does the same thing faster, or in less space.
Group of answer choices
OPTIMIZATION
ENCAPSULATION
ABSTRACTION
None of the Above
OPTIMIZATION
36
A modern programming language designed for large, long-lived applications – and embedded systems in particular – where reliability and efficiency are essential.
Group of answer choices
ADA
COBOL
FORTRAN
None of the Above
ADA
37
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.
Group of answer choices
True
False
True
38
Compilation is translation from one language into another, with full analysis of the meaning of the input.
Group of answer choices
True
False
True
39
The Java language definition defines a machine-independent intermediate form known as byte code.
Group of answer choices
True
False
True
40
The Lexcial Analyzer removes spaces and other unnecessary things like comments.
Group of answer choices
True
False
True
41
The parsing organizes tokens into a parse tree that represents higher-level constructs in terms of their constituents.
Group of answer choices
True
False
True
42
What is the Language possible to compile to very good (fast/small) code?
Group of answer choices
FORTRAN
PASCAL
COBOL
None of the Above
FORTRAN
43
The minor task of a linker is to search and locate referenced module/routines in a program
Group of answer choices
True
False
False
44
An interpreter uses a linker program to merge the appropriate library of subroutines.
Group of answer choices
True
False
False
45
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.
Group of answer choices
PASCAL
MODULA-3
FORTRAN
None of the Above
PASCAL
46
The language is intended for the way of thinking and way of expressing algorithms
Group of answer choices
True
False
True
47
In parsing it finds the structure you can describe with syntax diagrams.
Group of answer choices
True
False
True
48
The interpretation allows greater flexibility while Compilation use for better performance.
Group of answer choices
True
False
True
49
A program that converts the assembly language to machine-level language.
Group of answer choices
ASSEMBLER
INTERPRETER
TRANSLATOR
None of the Above
ASSEMBLER
50
The ________code is the standard format for distribution of Java programs.
Group of answer choices
BYTE
BIT
WORD
None of the Above
BYTE
51
Parsing is recognition of a context-free language.
Group of answer choices
True
False
True
52
Assembly-level instruction set is not implemented in hardware; it runs on an interpreter.
Group of answer choices
True
False
True
53
In C programming language , help you understand unions, arrays & pointers, separate compilation, var args, catch and throw.
Group of answer choices
True
False
True
54
The preprocessor deletes portions of code, which allows several versions of a program to be built from the same source
Group of answer choices
True
False
True
55
The term ___________refers to the processing of source code files (.c, .cc, or .cpp) and the creation of an 'object' file.
Group of answer choices
COMPILATION
INTERPRETATION
LINKER
None of the Above
COMPILATION
56
A general-purpose, imperative programming language that is especially suited to numeric computation and scientific computing.
Group of answer choices
FORTRAN
MODULA-3
C LANGUAGE
None of the Above
FORTRAN
57
The term parsing is part of the recognition of a regular language.
Group of answer choices
True
False
False
58
Scanning divides the program into "tokens", which are the smallest meaningful units; this saves time, since character-by-character processing is slow
Group of answer choices
True
False
True
59
The compiler merely produces the machine language instructions that correspond to the source code file that was compiled.
Group of answer choices
True
False
True
60
61
There are a number of algebraic laws that are obeyed by regular expressions, which can be used to manipulate regular expressions into equivalent forms.
Group of answer choices
True
False
True
62
The grammar defined by regular expressions is known as regular grammar.
Group of answer choices
True
False
True
63
A __________is a group of characters having a collective meaning.
Group of answer choices
TOKEN
STRING
None of the Above
NODE
TOKEN
64
In Notation, Union : (r)|(s) is a regular expression denoting L(r) U L(s).
Group of answer choices
True
False
True
65
An expression can be the sum of two expressions, or the product of two expressions, or a parenthesized subexpression.
Group of answer choices
True
False
True
66
A lexical analyzer, or ______ for short, will as its input take a string of individual letters and divide this string into tokens.
Group of answer choices
LEXAL
LEXER
LEXIS
None of the Above
LEXER
67
The word ______________in terms of programming languages, words are objects like variable names, numbers, keywords.
LEXICAL
68
The Lexical analyzer: reads input characters and produces a sequence of tokens as output.
Group of answer choices
True
False
True
69
The regular expressions is an algebraic notation for describing sets of strings.
Group of answer choices
True
False
True
70
A __________ over an alphabet is a finite sequence of symbols drawn from that alphabet.
STRING
71
A parser should be able to detect and report any error in the program.
Group of answer choices
True
False
t
72
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.
Group of answer choices
True
False
True
73
In error recovery choose a minimal sequence of changes to obtain a global least- cost correction.
Group of answer choices
True
False
t
74
A syntax analyzer or parser takes the input from a lexical analyzer in the form of token streams.
Group of answer choices
True
False
True
75
A type of error about some missing semicolon or unbalanced parenthesis.
Group of answer choices
None of the Above
LOGICAL
SYNTACTICAL
ANALYTICAL
SYNTACTICAL
76
The generated lexers are in a class of extremely simple programs called ________________.
FINITE AUTOMATA
77
The Lexical analyzer does not have to be an individual phase.
Group of answer choices
True
False
True
78
Tokens are specified by regular expressions.
Group of answer choices
True
False
True
79
Finite automata is a not recognizer for regular expressions.
Group of answer choices
True
False
False
80
In Notation, the Union: (r)(s) is a regular expression denoting L(r)L(s).
Group of answer choices
True
False
False
81
The Union of two languages L and M is written as L U M = {s | s is in L or s is in M}.
Group of answer choices
True
False
True
82
The regular expressions have the capability to express finite languages by defining a pattern for finite strings of symbols.
Group of answer choices
True
False
True
83
The viable-prefix property of parsers allows early detection of syntax errors.
Group of answer choices
True
False
True
84
According to handling errors, the logical errors: hard or impossible to detect.
Group of answer choices
True
False
True
85
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.
Group of answer choices
True
False
True
86
A ___________is a logical unit with respect to the rules of the source language.
Group of answer choices
PHRASE
None of the Above
SYNTAX
WORD
PHRASE
87
The Semantic analyzer: reads input characters and produces a sequence of tokens as output.
Group of answer choices
True
False
t
88
In verifying the validity of expressions in Lexical Analysis, a well-accepted solution is to use finite automata for verification.
Group of answer choices
True
False
t
89
A lexeme is a particular instant of a token.
Group of answer choices
True
False
True
90
A grammar is a set of strings over an alphabet.
Group of answer choices
True
False
False
91
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.
Group of answer choices
True
False
True
92
The Dynamic semantic errors: hard or impossible to detect at compile time, runtime checks are required.
Group of answer choices
True
False
True
93
The grammar designers have to be careful here because one wrong correction may lead to an infinite loop.
Group of answer choices
True
False
False
94
String: a group of characters having a collective meaning.
Group of answer choices
True
False
False
95
In Lexical analysis, a well-accepted solution is to use finite automata for verification.
Group of answer choices
True
False
True
96
It is not expected from the parser to check for errors but errors may be encountered at various stages of the compilation process.
Group of answer choices
True
False
97
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.
Group of answer choices
True
False
False
98
The language defined by regular grammar is known as Irregular language.
Group of answer choices
True
False
t
99
_____________is a state machine that takes a string of symbols as input and changes its state accordingly.
FINITE AUTOMATA
100
The lexical analyzer filters out whatever separates the tokens, lay-out characters and comments.
Group of answer choices
True
False
True
101
Error production: Some common errors are known to the compiler designers that may occur in the code.
Group of answer choices
True
False
True
102
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.
Group of answer choices
True
False
True
103
___________It is defined as the grammar in each programming language.
Group of answer choices
LOGICAL
SEMANTICAL
None of the Above
SYNTAX
SYNTAX
104
According to handling errors, the lexical errors: important, can sometimes recover.
Group of answer choices
True
False
False
105
The regular expression is a set of rules that say how to build a tree—a parse tree.
Group of answer choices
True
False
False
106
Lexical analyzer does not have to be an individual phase. But having a separate phase simplifies the design and improves the efficiency and portability.
Group of answer choices
True
False
True
107
In Finite Automata, Vertices – represents the states and ________ – represents transitions.
Group of answer choices
EDGES
VERTEX
None of the Above
ROOT
EDGES
108
In error handling, the lexical errors state: important, compiler can easily recover
and continue.
Group of answer choices
True
False
True
109
A type of error about the incompatible value assignment.
Group of answer choices
None of the Above
LOGICAL
SEMANTICAL
ANALYTICAL
SEMANTICAL
110
The pattern is the rule describing how a token can be formed.
Group of answer choices
True
False
True
111
A type of error about name of some identifier typed incorrectly.
Group of answer choices
LEXICAL
LOGICAL
SEMANTIC
None of the Above
LEXICAL
112
In syntax analysis, a parser is not required to detect and report any error in the program.
Group of answer choices
True
False
False
(is required)
113
Parsers use error recovering strategies.
Group of answer choices
True
False
True
114
A program may have the following kinds of errors at various stages: Lexical, Syntactical, Semantical and the ______________.
Group of answer choices
LOGICAL
SEMANTIC
None of the Above
ANALYTICAL
LOGICAL
115
Type of mode which is the easiest way of error-recovery and also, it prevents the parser from developing infinite loops.
Group of answer choices
ERROR MODE
PANIC MODE
PARITY MODE
None of the Above
PANIC MODE
116
It is not important to detect errors as soon as possible without further consuming unnecessary input.
Group of answer choices
True
False
False
117
In handling errors, the ______________ : most important for compiler, can almost
always recover.
Group of answer choices
ERROR MODE
PARITY MODE
SYNTAX ERRORS
None of the Above
SYNTAX ERRORS
118
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.
Group of answer choices
True
False
False
