The Gateway to Computer Science Excellence
+2 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
in Compiler Design by Veteran (425k points)
edited by | 180 views

@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 :)

1 Answer

+1 vote
Option C is correct
by (125 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,497 answers
100,816 users