The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
42 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.
asked in Compiler Design by Loyal (6.6k points)
edited by | 42 views
+1
$1.$ False, $LR(1)$ can be both $LR(0)$ and $LL(1)$

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

$3.$ True

Please log in or register to answer this question.

Related questions

+1 vote
1 answer
7
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,536 comments
71,152 users