Register

Closure in LR(1) sets

• edited by
668 views
1 votes
1 votes
Find the closure of S $\rightarrow$ .A ,dollar for the grammar

S --> A

A --> AB | $\varepsilon$

B --> aB | b
 

// I'm getting
S --> .A , dollar

A --> .AB, dollar

A --> . $\varepsilon$ , a,b
• edited by
User Avatar

Please log in or register to answer this question.

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

Related questions

1 votes
1 votes
0 answers
1
Shubhanshu asked Jan 7, 2018
672 views
Average length of stack in parsing LR(1)
Consider the following grammar: $S \rightarrow A$ $S \rightarrow xb$ $A \rightarrow aAb$ $A \rightarrow B$ $B \rightarrow x$ The average length of the stack used while parsing the string "axb$" using LR(1) parser is _________. I am getting 5, but answer is 2.5.
Consider the following grammar:$S \rightarrow A$$S \rightarrow xb$$A \rightarrow aAb$$A \rightarrow B$$B \rightarrow x$The average length of the stack used while parsing ...
User Avatar
2 votes
2 votes
0 answers
2
rahul sharma 5 asked Oct 14, 2017
1,534 views
Compiler Design:- Number of conflicts in LR(0)
Consider the following grammer:- Stmts -> Stmt | Stmts;Stmt Stmt -> Var =E Var ->id[E] | id E-> id | (E) Find the number of conflicts in LR(0)?
Consider the following grammer:-Stmts - Stmt | Stmts;StmtStmt - Var =EVar ->id[E] | idE- id | (E)Find the number of conflicts in LR(0)?
User Avatar
0 votes
0 votes
1 answer
4
aditi19 asked Mar 25, 2019
1,132 views
Compiler Design LR(1) doubt
Can lookahead symbol be epsilon in LR(1) parsing? and pls give the LR(1) diagram for the following grammar? A->AB | a B->*AC | Cb | ∈ C->+ABc | ∈
Can lookahead symbol be epsilon in LR(1) parsing?andpls give the LR(1) diagram for the following grammar?A->AB | aB->*AC | Cb | ∈C->+ABc | ∈
User Avatar
Link Copied!