Test: Lexical Analysis- 2

Question 1

In a two pass assembler pseudo code EQU is to be evaluated during

Accepted Answer

Pass 1

Answer

Pass 2

Answer

Not evaluated by the assembler

Answer

None of the above

Question 2

Pick the functions which are completely performed in pass 1

Accepted Answer

lil of the above

Answer

Updating the location counter

Answer

Processing of EQU pseudo op

Answer

Processing of DS pseudo op

Question 3

in a context-free grammar

Accepted Answer

Terminal symbols can’t be present in the left hand side of any production.

Answer

∈ can’t be the right hand side of any production.

Answer

The number of grammar symbols in the left hand side is not greater than that of in the right hand side.

Answer

All of the above

Question 4

If two finite state machines M and N are isomorphic, then

Accepted Answer

M can be transformed to N, merely re-labeling its states. .

Answer

M can he transformed to N, merely re-labeling its edges.

Answer

Me an be transformed to N, merely re-labeling its states and edges.

Answer

None of the above

Question 5

In an incompletely specified automata

Accepted Answer

Some states have no transition on some tokens.

Answer

No edge should be labeled epsilon.

Answer

From any given state, there can’t be any token leading to two different states.

Answer

Start state may not be there.

Question 6

Consider the following issues:
1. Simplify the phases.
2. Compiler efficiency is improved.
3. Compiler works faster.
4. Compiler portability is enhanced.

Which is/are true in context of lexical analysis?

Accepted Answer

1,2 and 4

Answer

1,2 and 3

Answer

1,3 and 4

Answer

All of these

Question 7

If G is a grammar with productions

S → SaS | aSb | bSa | SS | ∈

Where S is the start variable. Then which one of the following strings in not generated by G?

Accepted Answer

babba

Answer

abbaa

Answer

aaab

Answer

abab

Question 8

Given two DFA’s M₁, and M₂. They are equivalent if

Accepted Answer

M₁, and M₂ accepts the same language, i.e. L(M₁ ) = L(M₂)

Answer

M₁, and M₂ has the same number of states

Answer

M₁ and M₂ has the same number of final states

Answer

None of the above

Question 9

For the string aabbaa give the derivation tree using grammar:

G = {{S, A}, {a, b}, {S → aAS, S→ a, A → SbA, A→ SS, A → ba}, S}

Accepted Answer

Answer

Answer

Answer

Question 10

Consider a program P that consists of two source modules M₁ and M₂ contained in two different files. If M₁ contains a reference to a function defined in M₂the reference will be resolved at

Accepted Answer

Link-time

Answer

Edit-time

Answer

Compile-time

Answer

Load-time

Question 11

Consider line number 3 of the following C-program.
int main () { /* Line 1 */
int i, n; /* Line 2 */
fro (i = 0, i < n, /+ + ); /* Line 3 */
}

Identify the compiler’s response about this line while creating the object - module

Accepted Answer

Only syntactic errors

Answer

No compilation error

Answer

Only a lexical error

Answer

Both lexical and syntactic errors

Question 12

Consider the following grammars:

Which of the following statements is not true?

Accepted Answer

G₂ is ambiguous

Answer

G₁ corresponds to a regular language

Answer

G₁ corresponds to a language that can be recognized with an LR parser

Answer

G₂ is in Chomsky normal form

Question 13

Hash tables can contribute to an efficient average case solution for

Accepted Answer

Symbol table lookup

Answer

Counting distinct values

Answer

Dynamic dictionary

Answer

Range search

Question 14

Consider the grammar:

Which of the following sentence can be derived by this grammar?

Accepted Answer

abc

Answer

aab

Answer

abcc

Answer

abbc

Question 15

Which of the following is not a regular grammars?

Accepted Answer

A → aB | a, B → Ab | b

Answer

S →∈, A→ aS| b

Answer

A→ abB |aB

Answer

A→ Ba | Bab

GATE Computer Science Engineering(CSE) 2027 Test: Lexical Analysis- 2 Free

MCQ Practice Test & Solutions: Test: Lexical Analysis- 2 (15 Questions)

In a two pass assembler pseudo code EQU is to be evaluated during

Pick the functions which are completely performed in pass 1

in a context-free grammar

If two finite state machines M and N are isomorphic, then

In an incompletely specified automata

Consider the following issues:
1. Simplify the phases.
2. Compiler efficiency is improved.
3. Compiler works faster.
4. Compiler portability is enhanced.
Which is/are true in context of lexical analysis?

If G is a grammar with productions
S → SaS | aSb | bSa | SS | ∈
Where S is the start variable. Then which one of the following strings in not generated by G?

Given two DFA’s M₁, and M₂. They are equivalent if

For the string aabbaa give the derivation tree using grammar:
G = {{S, A}, {a, b}, {S → aAS, S→ a, A → SbA, A→ SS, A → ba}, S}

Consider a program P that consists of two source modules M₁ and M₂ contained in two different files. If M₁ contains a reference to a function defined in M₂the reference will be resolved at

Consider line number 3 of the following C-program.
int main () { /* Line 1 /
int i, n; / Line 2 /
fro (i = 0, i < n, /+ + ); / Line 3 */
}
Identify the compiler’s response about this line while creating the object - module

Consider the following grammars:
Which of the following statements is not true?

Hash tables can contribute to an efficient average case solution for

Consider the grammar:
Which of the following sentence can be derived by this grammar?

Which of the following is not a regular grammars?

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

Top Courses for Computer Science Engineering (CSE)

Schools

Competitive Exams

International Exams

Quick Links

About this Computer Science Engineering (CSE) Practice Test

Explore more Computer Science Engineering (CSE) Study Resources

GATE Computer Science Engineering(CSE) 2027 Test: Lexical Analysis- 2 Free

MCQ Practice Test & Solutions: Test: Lexical Analysis- 2 (15 Questions)

In a two pass assembler pseudo code EQU is to be evaluated during

Pick the functions which are completely performed in pass 1

in a context-free grammar

If two finite state machines M and N are isomorphic, then

In an incompletely specified automata

Consider the following issues: 1. Simplify the phases. 2. Compiler efficiency is improved. 3. Compiler works faster. 4. Compiler portability is enhanced.Which is/are true in context of lexical analysis?

If G is a grammar with productionsS → SaS | aSb | bSa | SS | ∈Where S is the start variable. Then which one of the following strings in not generated by G?

Given two DFA’s M1, and M2. They are equivalent if

For the string aabbaa give the derivation tree using grammar:G = {{S, A}, {a, b}, {S → aAS, S→ a, A → SbA, A→ SS, A → ba}, S}

Consider a program P that consists of two source modules M1 and M2 contained in two different files. If M1 contains a reference to a function defined in M2 the reference will be resolved at

Consider line number 3 of the following C-program. int main () { /* Line 1 */ int i, n; /* Line 2 */ fro (i = 0, i < n, /+ + ); /* Line 3 */ }Identify the compiler’s response about this line while creating the object - module

Consider the following grammars:Which of the following statements is not true?

Hash tables can contribute to an efficient average case solution for

Consider the grammar:Which of the following sentence can be derived by this grammar?

Which of the following is not a regular grammars?

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

Top Courses for Computer Science Engineering (CSE)

About this Computer Science Engineering (CSE) Practice Test

Explore more Computer Science Engineering (CSE) Study Resources

Consider the following issues:
1. Simplify the phases.
2. Compiler efficiency is improved.
3. Compiler works faster.
4. Compiler portability is enhanced.
Which is/are true in context of lexical analysis?

If G is a grammar with productions
S → SaS | aSb | bSa | SS | ∈
Where S is the start variable. Then which one of the following strings in not generated by G?

Given two DFA’s M₁, and M₂. They are equivalent if

For the string aabbaa give the derivation tree using grammar:
G = {{S, A}, {a, b}, {S → aAS, S→ a, A → SbA, A→ SS, A → ba}, S}

Consider a program P that consists of two source modules M₁ and M₂ contained in two different files. If M₁ contains a reference to a function defined in M₂the reference will be resolved at

Consider line number 3 of the following C-program.
int main () { /* Line 1 /
int i, n; / Line 2 /
fro (i = 0, i < n, /+ + ); / Line 3 */
}
Identify the compiler’s response about this line while creating the object - module

Consider the following grammars:
Which of the following statements is not true?

Consider the grammar:
Which of the following sentence can be derived by this grammar?