GATE CSE
First time here? Checkout the FAQ!
x
0 votes
36 views

 

What about empty rules?

asked in Compiler Design by Junior (615 points)   | 36 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

0 votes
2 answers
1
asked in Compiler Design by Vineeta Garg (247 points)   | 68 views
–1 vote
0 answers
2
+1 vote
1 answer
3
asked in Compiler Design by pranjalgennext Active (1.3k points)   | 64 views


Top Users May 2017
  1. akash.dinkar12

    3152 Points

  2. pawan kumarln

    1616 Points

  3. sh!va

    1580 Points

  4. Arjun

    1336 Points

  5. Devshree Dubey

    1230 Points

  6. Angkit

    1028 Points

  7. Debashish Deka

    1012 Points

  8. Bikram

    972 Points

  9. LeenSharma

    810 Points

  10. srestha

    662 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. pawan kumarln

    242 Points

  2. Ahwan

    138 Points

  3. joshi_nitish

    112 Points

  4. jjayantamahata

    104 Points

  5. Arjun

    64 Points


22,725 questions
29,056 answers
65,053 comments
27,566 users