Register

Compiler Design - Parsing Techniques
closed

• closed by
6,092 views
4 votes
4 votes
closed as a duplicate of: GATE CSE 1992 | Question: 02,xiv
Consider the SLR(1) and LALR(1) parsing tables for a context free grammar. Which of the following statements is/are true?

a] The goto part of both tables may be different.

b] The shift entries are identical in both the tables

c] The reduce entries in the tables may be different

d] The error entries in the tables may be different.
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Prasanna Devi asked Nov 17, 2018
378 views
Parsing techniques
Consider the grammar S->a/ab/abc A) it is LL(1) B) it is LL(2) C) it is LL(3)
Consider the grammarS->a/ab/abcA) it is LL(1)B) it is LL(2)C) it is LL(3)
User Avatar
0 votes
0 votes
1 answer
4
Kartheek8899 asked Oct 14, 2022
537 views
Compiler Design (Parsing)
S -> L = R S -> R L -> * R L -> id R -> L Is given CFG LR(0) & SLR(1)?
S - L = RS - RL - * RL - idR - LIs given CFG LR(0) & SLR(1)?
User Avatar
Link Copied!