First time here? Checkout the FAQ!
0 votes


What about empty rules?

asked in Compiler Design by Junior (621 points)   | 38 views
for that we need to find follow sets also and then check conflicts. But here they have not considered that.

For LL(1)

No ambiguity
o No left recursion
o A grammar G is LL(1) iff whenever A –> u | v are two distinct productions of G, the
following conditions hold:
o for no terminal a do both u and v derive strings beginning with a (i.e., first
sets are disjoint)
o at most one of u and v can derive the empty string
o if v =>* ε then u does not derive any string beginning with a terminal in
Follow(A) (i.e., first and follow must be disjoint if nullable)
tnx...I got your point regarding empty rules but they haven't mentioned anything about empty rules so how we can assume empty rules won't make conflicts as follow(X) may conflict with any rule.

Please log in or register to answer this question.

Related questions

+1 vote
1 answer
asked in Compiler Design by shefali1 Active (1k points)   | 71 views
0 votes
2 answers
asked in Compiler Design by Vineeta Garg (247 points)   | 81 views
–1 vote
0 answers

Top Users Aug 2017

    4658 Points

  2. Bikram

    4130 Points

  3. akash.dinkar12

    3144 Points

  4. rahul sharma 5

    2920 Points

  5. manu00x

    2682 Points

  6. makhdoom ghaya

    2390 Points

  7. just_bhavana

    2058 Points

  8. Tesla!

    1782 Points

  9. pawan kumarln

    1574 Points

  10. learner_geek

    1558 Points

24,892 questions
31,967 answers
30,083 users