500 views
1 votes
1 votes

Is the following statement is true or false?

top down parsing is implemented using the set of recursive procedures and implementation of bottom up parsing is done using the stack and input buffer.

My doubt: - According to me this is false because TDP in case of LL(1) is implemented using stack and input buffer but given answer is true

1 Answer

0 votes
0 votes
for any type of parse either LL(1) or LR parser i/p buffer and stack is need ,only parser differ

BUT in your question in TDP it is taking about recursive descent parser so it is true

Related questions

2 votes
2 votes
2 answers
2
s_dr_13 asked Jan 3, 2022
461 views
if a grammar is CLR(1) with no mergeable states, then it is LALR(1) ? I suppose it is “yes”, am I right?
0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4
Hirak asked Jun 1, 2019
2,030 views
S → aSbS /bSaS / ϵS → aABb A→ c/ ϵ B → d/ ϵWhich of the following is LL1. Explain in details.