COMPILER DESIGN: Dragon Book self doubt

Question

S→ A/a

A→ a

LL1 or not?

Comments

not LL1

---

Because S--> A and S--> a are the two productions of S for 'a' right?

---

yes..

Answer 1

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

Answer 2

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)

Answer 3

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.

Answer 4

Not LL(1) ..not pair wise disjoint