1,942 views

2 Answers

2 votes
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
–2 votes
B) iii
edited by

Related questions

2 votes
2 votes
1 answer
1
Prakash059 asked May 3, 2016
1,959 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?...
0 votes
0 votes
2 answers
2
prasitamukherjee asked Jul 16, 2015
857 views
q. 23 : can anyone explain why both statements are false? I thought option B is correct?
0 votes
0 votes
1 answer
3
1 votes
1 votes
1 answer
4
Pawan Kumar 7 asked Jun 16, 2018
4,329 views
"A bottom up parser tries to find the right most deviation of the given input in the reverse order " what does this line mean Please Explain