Avatto > UGC NET COMPUTER SCIENCE > PRACTICE QUESTIONS > Theory of Computation and Compilers > Syntax Analysis

Theory of Computation and Compilers MCQ - Syntax Analysis

1 The pass numbers for each of the following activities
(i) object code generation
(ii) literals added to literal table
(iii) listing printed
(iv) address resolution of local symbols that occur in a two pass assembler respectively are

In two pass assembler,
Purpose: Generate object program.
1. Substitute the corresponding address for each symbol.
2. Generate instruction, which are opcode are subst ituted for machine instruction.
3. Data is generated.
4. Some pseudo operations are also executed.

2 The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called

Relocation of code is the process done by the linker-loader when a program is copied from external storage into main memory.

3 Which of the following statements is false?

A grammar is said to be ambiguous if there exist more than one parse tree for a string.

Consider the context free grammar
E → E + E
E → (E * E)
E → id
Where E is the starting symbol, the set of terminals is {id, (, + ,), *} and the set of non terminal is {E}.

4 Which of the following terminal strings has more than one parse tree where parsed according to above grammar?

Has more than one parse tree

Consider the context free grammar
E → E + E
E → (E * E)
E → id
Where E is the starting symbol, the set of terminals is {id, (, + ,), *} and the set of non terminal is {E}.

5 For the terminal string with more than one parse tree obtained as solution to in above Question, how many parse trees are possible?

Total 5 different parse trees are there.

Your Progress

0%

Start Practising!

You've answered 0 of 42 questions in this topic.

Practice Spotlight

Build momentum in Syntax Analysis

Start with a short question set, review every explanation, and revisit difficult questions before moving ahead.

Day 7 / 10

Global Spotlight

Challenge Your Accuracy

Strong work at 0% accuracy. Attempt the hardest Syntax Analysis questions and explain why every incorrect option is wrong.

Day 1 / 10

Question Spotlight

Question:

Consider the following expression grammar G: E → E – T|T T → T + F|F F → (E)|id Which of the following grammars is not left recursive,…

A. E → E-T|T
T → T + F|F
F → (E)|id
B. E → TE'
E' → TE'|∈
T → T + F|F
F → (E)| id
C. E → TE
X → –TX|∈
T → FY
T → +FY|∈
F → (E) |id
D. E → TX|(TX)
X → TX|+TX|∈
T → id

Correct answer: C

Explanation:

left recursion: A → Aα/β After removing left recursion it can be written as A → βA’ A' → αA'/ε So apply above rule for Variable E and…

Click to view the complete question details

Day 7 / 10 Open this question

Community Insight

Based on 39 saved attempts

Most Attempted TopicBasic Of Compiler Design
Most Challenging TopicBasic Of Compiler Design
Average Accuracy87%

Featured Question

(Based on recent community answers)

Q. #32639New

Consider the following expression grammar G: E → E – T|T T → T +…

Try This Question →

This Week's Challenge

Complete 20 questions and set the community benchmark!

0 / 20 Start Challenge →

Why Practice with Avatto?

High Quality MCQsExam-focused questions with accurate answers

Detailed ExplanationsStep-by-step explanations to enhance learning

Latest Exam PatternBased on updated syllabus and pattern

Performance AnalyticsTrack performance and improve weak areas

100% Free PracticePractice unlimited questions for free

Forgot your password?

I agree with the Terms.