.. (לתיקייה המכילה) | ||
Question 1, Should we show all steps and iterations of the algorithm? | |
Yes. |
Question 2.2, What example should we find? | |
A non trivial grammar which isn't LL(3). |
Question 3.d,3.e What is the initial variable? | |
You should try to build a general grammar that satisfies the condition. |
Question 3.d | |
The intersection returns a grammar G which generates all the words belong to G1 *and* G2. |