edited by
1,215 views
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}$$

  1. i-b; ii-c; iii-a; iv-d
     
  2. i-d; ii-a; iii-c; iv-d
     
  3. i-c; ii-b; iii-d; iv-a
     
  4. i-a; ii-c; iii-b; iv-d
edited by

2 Answers

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
Answer:

Related questions

6 votes
6 votes
2 answers
1
Arjun asked Jan 26, 2019
1,694 views
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduceshift-reduce conflictreduce-reduce conflictno extra conflictboth shift-reduce as well as redu...