4 votes 4 votes Match the following: $$\begin{array}{|cc|cc|} \hline (i) &LL(1)&(A)& \text{bottom-up} \\ \hline (ii)& \text{Recursive Descent}& (B) &\text{Predictive} \\ \hline (iii) &\text{Recursive Ascent}& (C)& \text{Top-down} \\ \hline (iv) &LR(1) &(D)& \text{Deterministic CFL} \\ \hline \end{array}$$ i-b; ii-c; iii-a; iv-d i-d; ii-a; iii-c; iv-d i-c; ii-b; iii-d; iv-a i-a; ii-c; iii-b; iv-d Compiler Design go-cd-1 parsing + – Arjun asked Jan 26, 2019 edited Jan 26, 2019 by Arjun Arjun 1.2k views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Arjun commented Jan 26, 2019 reply Follow Share Yes, but in Match the following you should pick the most suitable one. Only LR(1) can match to DCFL though if it is not there, anything on LHS can map to it. 5 votes 5 votes Mk Utkarsh commented Jan 26, 2019 reply Follow Share I also marked C :( 1 votes 1 votes Arjun commented Jan 26, 2019 reply Follow Share This is just trial right - be careful on the D-day :) 3 votes 3 votes Please log in or register to add a comment.
2 votes 2 votes Option C is correct Laxmikant sahu answered Feb 17, 2019 Laxmikant sahu comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes LL1 is a top-down or predictive parser REC Decent is predictive REC Ascent is a technique for implementing an LALR parser so Bottom up LR(1) is bottom-up or DCFL, since LR(K) accepts DCFL Mohitdas answered Sep 25, 2021 Mohitdas comment Share Follow See all 0 reply Please log in or register to add a comment.