FA2

Question 1

A __________is a group of characters having a collective meaning.

Group of answer choices

None of the Above

TOKEN

NODE

STRING

Answer 1

TOKEN

Question 2

The regular expression is a set of rules that say how to build a tree—a parse tree.

Group of answer choices

True

False

Answer 2

F

Question 3

A grammar is a set of strings over an alphabet.

Group of answer choices

True

False

Answer 3

F

Question 4

The Lexical analyzer does not have to be an individual phase.

Group of answer choices

True

False

Answer 4

T

Question 5

A __________ over an alphabet is a finite sequence of symbols drawn from that alphabet.

Answer 5

STRING

Question 6

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

Answer 6

T

Question 7

The grammar defined by regular expressions is known as regular grammar.

Group of answer choices

True

False

Answer 7

F

Question 8

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

Answer 8

T

Question 9

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

Answer 9

T

Question 10

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

Answer 10

T

Question 11

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

Answer 11

T

Question 12

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

Answer 12

F

Question 13

___________It is defined as the grammar in each programming language.

Group of answer choices

SEMANTICAL

SYNTAX

LOGICAL

None of the Above

Answer 13

SYNTAX

Question 14

A type of error about the incompatible value assignment.

Group of answer choices

LOGICAL

SEMANTICAL

ANALYTICAL

None of the Above

Answer 14

SEMANTICAL

Question 15

A type of error about some missing semicolon or unbalanced parenthesis.

Group of answer choices

ANALYTICAL

LOGICAL

None of the Above

SYNTACTICAL

Answer 15

SYNTACTICAL

Question 16

The Semantic analyzer: reads input characters and produces a sequence of tokens as output.

Group of answer choices

True

False

Answer 16

T

Question 17

_____________is a state machine that takes a string of symbols as input and changes its state accordingly.

Answer 17

FINITE AUTOMATA

Question 18

In Notation, Union : (r)|(s) is a regular expression denoting L(r) U L(s).

Group of answer choices

True

False

Answer 18

T

Question 19

A lexeme is a particular instant of a token.

Group of answer choices

True

False

Answer 19

T

Question 20

The generated lexers are in a class of extremely simple programs called ________________.

Answer 20

FINITE AUTOMATA

Question 21

The language defined by regular grammar is known as Irregular language.

Group of answer choices

True

False

Answer 21

T

Question 22

The regular expressions is an algebraic notation for describing sets of strings.

Group of answer choices

True

False

Answer 22

T

Question 23

The pattern is the rule describing how a token can be formed.

Group of answer choices

True

False

Answer 23

T

Question 24

In Lexical analysis, a well-accepted solution is to use finite automata for verification.

Group of answer choices

True

False

Answer 24

T

Question 25

Expression: a := x * y + z After lexical analysis, this statement has the structure: id1 assign id2 binop1 id3 binop2 id4 Group of answer choices True False

Answer 25

T

Question 26

A ___________is a logical unit with respect to the rules of the source language. Group of answer choices None of the Above PHRASE SYNTAX WORD

Answer 26

PHRASE

Question 27

According to handling errors, the lexical errors: important, can sometimes recover. Group of answer choices True False

Answer 27

F

Question 28

In error handling, the lexical errors state: important, compiler can easily recover and continue. Group of answer choices True False

Answer 28

T

Question 29

The Dynamic semantic errors: hard or impossible to detect at compile time, runtime checks are required. Group of answer choices True False

Answer 29

T

Question 30

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

Answer 30

T

Question 31

The Lexical analyzer: reads input characters and produces a sequence of tokens as output. Group of answer choices True False

Answer 31

T

Question 32

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

Answer 32

T

Question 33

The lexical analyzer filters out whatever separates the tokens, lay-out characters and comments. Group of answer choices True False

Answer 33

T

Question 34

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

Answer 34

T

Question 35

The viable-prefix property of parsers allows early detection of syntax errors. Group of answer choices True False

Answer 35

T

Question 36

In handling errors, the ______________ : most important for compiler, can almost always recover. Group of answer choices None of the Above SYNTAX ERRORS ERROR MODE PARITY MODE

Answer 36

SYNTAX ERRORS

Question 37

It is not important to detect errors as soon as possible without further consuming unnecessary input. Group of answer choices True False

Answer 37

F

Question 38

Tokens are specified by regular expressions. Group of answer choices True False

Answer 38

T

Question 39

Finite automata is a not recognizer for regular expressions. Group of answer choices True False

Answer 39

F

Question 40

The word ______________in terms of programming languages, words are objects like variable names, numbers, keywords.

Answer 40

LEXICAL

Question 41

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

Answer 41

F

Question 42

In Notation, the Union: (r)(s) is a regular expression denoting L(r)L(s). Group of answer choices True False

Answer 42

F

Question 43

String: a group of characters having a collective meaning. Group of answer choices True False

Answer 43

F

Question 44

In Finite Automata, Vertices – represents the states and ________ – represents transitions. Group of answer choices VERTEX ROOT None of the Above EDGES

Answer 44

EDGES

Question 45

Error production: Some common errors are known to the compiler designers that may occur in the code. Group of answer choices True False

Answer 45

T

Question 46

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

Answer 46

T

Question 47

A program may have the following kinds of errors at various stages: Lexical, Syntactical, Semantical and the ______________. Group of answer choices ANALYTICAL LOGICAL SEMANTIC None of the Above

Answer 47

LOGICAL

Question 48

A syntax analyzer or parser takes the input from a lexical analyzer in the form of token streams. Group of answer choices True False

Answer 48

T

Question 49

In syntax analysis, a parser is not required to detect and report any error in the program. Group of answer choices True False

Answer 49

F

Question 50

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 None of the Above LEXER LEXAL LEXIS

Answer 50

LEXER

Question 51

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 PARITY MODE None of the Above PANIC MODE ERROR MODE

Answer 51

PANIC MODE

Question 52

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

Answer 52

T

Question 53

The grammar designers have to be careful here because one wrong correction may lead to an infinite loop. Group of answer choices True False

Answer 53

F

Question 54

According to handling errors, the logical errors: hard or impossible to detect. Group of answer choices True False

Answer 54

T

Question 55

Parsers use error recovering strategies. Group of answer choices True False

Answer 55

T

Question 56

A parser should be able to detect and report any error in the program. Group of answer choices True False

Answer 56

T

Question 57

In error recovery choose a minimal sequence of changes to obtain a global least- cost correction. Group of answer choices True False

Answer 57

T

Question 58

A type of error about name of some identifier typed incorrectly. Group of answer choices LEXICAL None of the Above SEMANTIC LOGICAL

Answer 58

LEXICAL