Register

Compiler Design (Parsing)

• retagged by
539 views

1 Answer

0 votes
0 votes

I think yes it’s both SLR(1) & LR(0)

Correct it if any mistake exists!!

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

Related questions

6 votes
6 votes
2 answers
1
Arjun asked Jan 26, 2019
1,739 views
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 1
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduce shift-reduce conflict reduce-reduce conflict no extra conflict both shift-reduce as well as reduce-reduce
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduceshift-reduce conflictreduce-reduce conflictno extra conflictboth shift-reduce as well as redu...
User Avatar
0 votes
0 votes
1 answer
3
Na462 asked Jan 16, 2019
793 views
MadeEasy Subject Test 2019: Compiler Design - Parsing
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.
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 Syn...
User Avatar
Link Copied!