Tools

LL(1) Parser

Consider the following grammar:
          S → aS'
          S' → aS' | ε
Which of the following is/are true for the above grammar?
Consider the following Grammar G:
          S → Ae
          A → CbD
          C → BC | ε
          B → cdD | acdD
          D → c | ε
In LL(1) parse table of above grammar G, How many cells are having multiple entries?
Consider the following grammar:
          S → FR
          R → S | ε
          F → id
In the predictive parser table, M, of the grammar the entries M[S, id] and M[R, $] respectively:
Calculate the First(S) and Follow(A) functions for the given grammar:
          S → AaAb / BbBa
          A → ∈
          B → ∈
Consider the following Grammar G:
          S → Ae
          A → CbD
          C → BC | ε
          B → cdD | acdD
          D → c | ε
WhWich of the following is false?