$1.$ False, $LR(1)$ can be both $LR(0)$ and $LL(1)$

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

$3.$ True

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

$3.$ True

0 votes

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.

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.

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

0 votes

S1: False

Refer this: https://stackoverflow.com/questions/34707467/is-every-ll1-grammar-also-an-lr0-grammar

S2: False

Refer this : https://gateoverflow.in/1251/gate-cse-2007-question-53

S3: TRUE

Refer this: https://www.csd.uwo.ca/~mmorenom/CS447/Lectures/IntermediateCode.html/node3.html