Timeline for answer to How to find FIRST sets for a recursive grammar by user2277550
Current License: CC BY-SA 4.0
Post Revisions
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 15, 2020 at 15:20 | vote | accept | FatimahFatCakes | ||
| Oct 10, 2019 at 4:47 | comment | added | user2277550 | The third rule is what you want. If both the first and the follow sets are the same, then the grammar is not in LL(1) :) | |
| Oct 10, 2019 at 4:45 | history | edited | user2277550 | CC BY-SA 4.0 |
deleted 10 characters in body
|
| Oct 10, 2019 at 4:35 | history | edited | user2277550 | CC BY-SA 4.0 |
added 66 characters in body; deleted 8 characters in body; deleted 1 character in body; added 10 characters in body; deleted 8 characters in body
|
| Oct 10, 2019 at 4:34 | comment | added | FatimahFatCakes | I understand, but when if I do FIRST(SL), I keep going back to FIRST(S), which goes to FIRST(SL) ⋃ FIRST(ε) = FIRST(S) ⋃ {ε}, and the FIRST(S) will repeat itself over and over. | |
| Oct 10, 2019 at 4:31 | history | edited | user2277550 | CC BY-SA 4.0 |
added 219 characters in body
|
| Oct 10, 2019 at 4:27 | comment | added | FatimahFatCakes | I'm sorry but can you elaborate further? I'm not sure what you mean. Those just look like the basic rules for the FIRST set. Thank you! | |
| Oct 10, 2019 at 4:23 | history | answered | user2277550 | CC BY-SA 4.0 |