GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 13

Question

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}$$

• A. i-b; ii-c; iii-a; iv-d
   
• B. i-d; ii-a; iii-c; iv-d
   
• C. i-c; ii-b; iii-d; iv-a
   
• D. i-a; ii-c; iii-b; iv-d

Comments

A?

---

@Arjun Sir, 

option C is correct one. pls update this.

---

LL(1) is bottom-up parser.

 A form of recursive-descent parsing that does not require any back-tracking is known as predictive parsing

III and IV both can map to bottom-up parsing

---

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.

---

I also marked C :(

---

This is just trial right - be careful on the D-day :)

Answer 1

Option C is correct

Answer 2

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