934 views
2 votes
2 votes
S→ A/a

A→ a

LL1 or not?

4 Answers

3 votes
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
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
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.

Related questions

0 votes
0 votes
1 answer
1
Hirak asked Jun 1, 2019
2,031 views
S → aSbS /bSaS / ϵS → aABb A→ c/ ϵ B → d/ ϵWhich of the following is LL1. Explain in details.
0 votes
0 votes
2 answers
3
1 votes
1 votes
1 answer
4
Ayush Upadhyaya asked Mar 3, 2019
714 views
$L=\{x^n:n \in N\} \cup\{x^ny^n|n \in N\}$This language does not have LL(k) parser while being deterministic context free.Why?