search
Log In
0 votes
288 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
edited by
288 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).

2 Answers

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  ??

Related questions

2 votes
2 answers
2
1 vote
1 answer
4
...