The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
116 views

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
asked in Compiler Design by Veteran (408k points)
edited by | 116 views
+1
A?
+2

@Arjun Sir, 

option C is correct one. pls update this.

0

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

+2
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.
0
I also marked C :(
+2
This is just trial right - be careful on the D-day :)

1 Answer

0 votes
Option C is correct
answered by (115 points)
Answer:

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
49,588 questions
54,197 answers
187,535 comments
71,152 users