Register

Unacademy Compiler Design Workbook

420 views
1 votes
1 votes

Consider the following statements:

(A) LL (k) grammars have one to one correspondence with DCFLs.

(B) LR (k) grammars have one to one correspondence with CFLs.

 

  1. A is true but B is false
  2. A is false but B is true
  3. Both are False
  4. Both are True
User Avatar

2 Answers

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

467
views
2 answers
1 votes
lovish_bhatia asked Sep 12, 2023
467 views
Unacademy Compiler Design Workbook
Conisder the following program:Main(){ int x = 10;If (x<20 ;Elsey = 20;}When lexical analyzer scanning the above program, how many lexical errors can be produced?
User Avatar
137
views
0 answers
0 votes
Ebrahim asked May 5
137 views
Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q4. Generate target code for the following source language statements : x = a + b + c * (d-e) 
User Avatar
98
views
0 answers
0 votes
Ebrahim asked May 5
98 views
Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q2. Implement the statement a:= -b + c*(d-e) + f * (c*(d-e)) into following Intermediate code representation.  a) Quadrupleb) Triple c) Indirect Triple Solve the above Question like this example
User Avatar
275
views
1 answers
0 votes
Ebrahim asked Jan 12
275 views
Compiler-design
Q1. For the following grammar N -> AB | BA A -> a | CAC B -> b | CBC C -> a | b Find the FIRST and FOLLOW
User Avatar
Link Copied!