search
Log In
1 vote
261 views
S→ A/a

A→ a

LL1 or not?
in Compiler Design 261 views
1
not LL1
1
Because S--> A and S--> a are the two productions of S for 'a' right?
1
yes..

4 Answers

3 votes

this is not LL(1) because intersection is there,both are going to same cell infact this grammer is ambiguous.

Ambiguous grammer cannot parse by any parsers except operator precedence parser

2 votes
If a grammar is ambiguous then it never be LL(1),LR(0),SLR,LALR,CLR.

Given grammar is ambiguous . So its not LL(1)
0 votes
Given grammar is  ambiguous .even 2 parse tree generated for a string 'a'.
and if the grammar is ambiguous it can not be LL(1), LR(0),SLR(1), LALR(1) and CLR(1) also.
0 votes
Not LL(1) ..not pair wise disjoint

Related questions

0 votes
1 answer
1
164 views
S → aSbS /bSaS / ϵ S → aABb A→ c/ ϵ B → d/ ϵ Which of the following is LL1. Explain in details.
asked Jun 1, 2019 in Compiler Design Hirak 164 views
1 vote
0 answers
2
398 views
Why ε is not shown in First(S). First(s) does contain ε . And please help me figure out which grammar is this? According to me it is NOT LL(1) (since it is left factored), NOT LR(0) (Since the Item 0 has a R-R conflict), NOT SLR(1) (The item 0 has a RR conflict since Follow(X) = Follow(Y) = {a,b} correct me If i'm wrong
asked Nov 23, 2018 in Compiler Design Hopealways 398 views
0 votes
1 answer
3
151 views
In this why questions why the left recursion is not removed as it is necessary for $LL1 $ Why they given the option without removing the left recursion $S->Aa|b$ $A->Ac|Sd|Null$
asked May 24, 2018 in Compiler Design Prince Sindhiya 151 views
8 votes
3 answers
4
...