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

 

What about empty rules?

asked in Compiler Design by Junior (621 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)   | 72 views
–1 vote
0 answers
2
+1 vote
1 answer
3
asked in Compiler Design by pranjalgennext Active (1.3k points)   | 65 views


Top Users Jun 2017
  1. Bikram

    3704 Points

  2. Hemant Parihar

    1484 Points

  3. junaid ahmad

    1432 Points

  4. Arnab Bhadra

    1408 Points

  5. Niraj Singh 2

    1311 Points

  6. Rupendra Choudhary

    1194 Points

  7. rahul sharma 5

    1132 Points

  8. Debashish Deka

    1004 Points

  9. srestha

    932 Points

  10. Arjun

    930 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 19 - 25
  1. Bikram

    1960 Points

  2. Niraj Singh 2

    1306 Points

  3. junaid ahmad

    502 Points

  4. sudsho

    410 Points

  5. akankshadewangan24

    388 Points


23,355 questions
30,066 answers
67,371 comments
28,382 users