System Software and Compilers-Parsing and Parse Trees [NTA-NET (UGC-NET) Computer Science & Applications (87)]: Questions 1 - 4 of 4

Choose Programs:

⏳ 🎯 Online Tests (4 Tests [100 questions each]): NTA Pattern, Analytics & Explanations

Rs. 800.00 -OR-

3 Year Validity (Multiple Devices)

Sample TestsDetailsSee Demo

🎓 Study Material (2083 Notes): 2024-2025 Syllabus

Rs. 1250.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 2699 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 600.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

Help me Choose & Register (Watch Video) Already Subscribed?

Question 1

Appeared in Year: 2010

Question MCQ▾

Which of the following expression is represented by the parse tree?

The Parse Tree

(June Paper II)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 2

Appeared in Year: 2012

Question MCQ▾

Which of the following is the most powerful parsing method? (December Paper II)

Choices

Choice (4)Response

a.

LL (I)

b.

Canonical LR

c.

SLR

d.

LALR

Edit

Question 3

Appeared in Year: 2013

Question MCQ▾

Which of the following derivations does a top-down parser use while parsing an input string? The input is scanned from left to right. (December Paper-II)

Choices

Choice (4)Response

a.

Leftmost derivation

b.

Leftmost derivation traced out in reverse

c.

Rightmost derivation traced out in reverse

d.

Rightmost derivation

Edit

Question 4

Appeared in Year: 2018

Question MCQ▾

Consider the following grammar G: (December)

Where {S, A, B} is the set of non-terminals, {a, b, c} is the set of terminals.

Which of the following statements is/are correct?

S1: LR (1) can parse all strings that are generated using grammar G.

S2: LL (1) can parse all strings that are generated using grammar G.

Choose the correct answer from the code given below:

Choices

Choice (4)Response

a.

Only S2

b.

S1 and S2

c.

Only S1

d.

Neither S1 nor S2

Edit