Register

compiler grammar

• retagged by
771 views

1 Answer

2 2 votes

After some googling, I found this grammar to be LL(1) but not LALR

S -> (X | E] | F)
X -> E) | F]
E -> A
F -> A
A -> ε

LALR fails because there is reduce reduce conflicts in E and F productions.

With LL(1), decision is made based on the FIRST set of alternatives where ')' and ']' falls in different set of alternatives.

Credits: stackoverflow

Voting & Accepting an answer helps improve the community
← Previous · Given a push down au...Next → · Routing algorithm
← Previous in category · GATE CSE 1988 | Ques...Next in category → · Consider the regular...
Position:
Show:

Related questions

0 0 votes
1 1 answer
942
942 views
GateAspirant999 asked Dec 10, 2016
942 views
Is this grammar LL1, LR0, SLR1, LALR1, CLR1?
$S\rightarrow (x$$\text{ }| E]$$\text{ }| F)$$X\rightarrow E)$$\text{ }| F]$$E\rightarrow A$$F\rightarrow A$$A\rightarrow \lambda$
1 1 vote
1 answers 1 answer
596
596 views
learner_geek asked Aug 2, 2017
596 views
Compiler parser
is this given diagram correct or incorrect if incorrect then please correct it .
2 2 votes
2 answers 2 answers
4.2k
4.2k views
sripo asked Nov 10, 2018
4,204 views
If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?
Can you give an example which is not LL(1) but is CLR(1)
0 0 votes
3 answers 3 answers
2.4k
2.4k views
Parshu gate asked Dec 5, 2017
2,381 views
Type of grammar
Why isn't it LL(1) ?