First time here? Checkout the FAQ!
0 votes


What about empty rules?

asked in Compiler Design by (441 points)   | 25 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
0 answers
+1 vote
1 answer
asked in Compiler Design by pranjalgennext Active (1k points)   | 34 views
+1 vote
1 answer
Top Users Jan 2017
  1. Debashish Deka

    8126 Points

  2. sudsho

    5042 Points

  3. Habibkhan

    4706 Points

  4. Vijay Thakur

    4458 Points

  5. Bikram

    4348 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4010 Points

  8. santhoshdevulapally

    3722 Points

  9. GateSet

    3292 Points

  10. Sushant Gokhale

    3286 Points

Monthly Topper: Rs. 500 gift card

19,122 questions
24,033 answers
20,276 users