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

 

What about empty rules?

asked in Compiler Design by Junior (613 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.

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please log in or register.

Related questions

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


Top Users Apr 2017
  1. akash.dinkar12

    3660 Points

  2. Divya Bharti

    2580 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Debashish Deka

    1614 Points

  7. Shubham Sharma 2

    1610 Points

  8. Prashant.

    1492 Points

  9. Arjun

    1472 Points

  10. Arunav Khare

    1464 Points

Monthly Topper: Rs. 500 gift card

22,088 questions
28,063 answers
63,298 comments
24,173 users