The Gateway to Computer Science Excellence
0 votes
140 views
Which of the Statements are True :

S1: LR(1) grammar can be LR(0) but not LL(1).

S2 : Every regular language is LL(1)

S3 : Three address code is linear representation of Syntax Tree.
in Compiler Design by
edited by | 140 views
+2
$1.$ False, $LR(1)$ can be both $LR(0)$ and $LL(1)$

$2.$ Every regular is not $LL(1)$

$3.$ True
0
LR(1) grammer may or may not be LL(1) and LR(0).

1 Answer

0 votes
3 Address Code is a linear representation of Intermediate Code and Syntax is a tree representation of Intermediate Code. Then how can Three address code is linear representation of Syntax Tree  ??
by
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
52,345 questions
60,484 answers
201,813 comments
95,289 users