search
Log In
0 votes
1.1k views

in Unknown Category 1.1k views
1
Is the answer B).

2 Answers

2 votes

Answer is B).

1. True as TDP uses LMD (left most deriviation) and BUP use reverse of RMD (right most deriviation).

2. True as recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures and LR parser which is BUP uses stack .

3. Backtracking is not for bottom up parser BUP as shift-reduce parser's efficiency is from doing no backups or backtracking.

–2 votes
B) iii

edited by
–1

(i) it is correct as Top down parser does left most derivartion and bottom up uses right most derivation

(ii) it is not true because LL(1) is a top down parser which uses stack and input buffer.

(iii)it's correct, Backtracking is required in both when we reach to invalid point while derivation.

I think only (ii) is wrong

–2

I found this question in kanodia's GATE preparation book.

Answer given is B

Explanation is given as no backtracking is used in top down parsing

0
Ohhh i didnt read the question well i thought the question is for correct option thats why....

Related questions

0 votes
1 answer
1
210 views
Which approach is better and preferred ? 1) Top-Down Design 2) Bottom Up Design 3) Hybrid Design
asked Dec 3, 2016 in Revision LavTheRawkstar 210 views
2 votes
1 answer
2
393 views
If a grammer(CFG) is ambiguous then we can construct the topdown and bottomup parsing is possible directly???or we will make them into unambiguous then we will construct???
asked May 3, 2016 in Compiler Design Prakash059 393 views
0 votes
2 answers
3
366 views
q. 23 : can anyone explain why both statements are false? I thought option B is correct?
asked Jul 16, 2015 in Compiler Design prasitamukherjee 366 views
3 votes
2 answers
4
307 views
Given answer is (D), how?
asked Jan 27, 2018 in Compiler Design Manu Thakur 307 views
...