Grammar Analysis Seminar Homework: Identifying Grammar Types, Exercises of Theory of Formal Languages for Automata

Download Grammar Analysis Seminar Homework: Identifying Grammar Types and more Exercises Theory of Formal Languages for Automata in PDF only on Docsity! Seminar 2: Homework - February 2022 1. Specify language generated by the grammar G = (VN , VT , S, P ): (a) VN = {A}, VT = {a, b}, S = A, P = {A → aA|b} (b) VN = {x0, x1, x2}, VT = {A,B, ..., Z}, S = x0, P = {x0 → Ex1, x1 → Nx2, x2 → D} (c) VN = {A}, VT = {0, 1, 2}, S = A, P = {A → 0A0|1A1|2A2|λ} (d) VN = {S,A}, VT = {0, 1, ..., 9, .}, P = {S → A.A,A → 0A|1A|...|9A|0|1|...|9} (e) VN = {A,B,C}, VT = {0, 1}, S = A, P = {A → 0A|1B|1, B → 0C|1A, C → 0B|1C|0} (f) VN = {S,A,B,C}, VT = {0, 1, ..., 9,+,−}, P = {S → +A|−A|A, A → 0A|1A|...|9A|0|...|9} (g) VN = {S}, VT = {(, )}, P = {S → S(S)S|λ} (h) VN = {E, T, F}, VT = {(, ), i,+, ∗}, S = E, P = {E → E + T |T, T → T ∗ F |F, F → (E)|i} (i) VN = {S,A,B}, VT = {a, b, c}, S = E, P = {S → abc|aAbc, Ab → bA,Ac → Bbcc, bB → Bb, aB → aaA|aa} (j) VN = {S,A,B,C,D,E}, VT = {a}, P = {S → ACaB,Ca → aaC,CB → DB|E, aD → Da,AD → AC, aE → Ea,AE → λ} (k) VN = {S,A,B,C,D,E}, VT = {a, b}, P = {S → ABC,AB → aAD|bAE,DC → BaC,EC → BbC,Da → aD,Db → bD,Ea → aE,Eb → bE,Db → bD,AB → λ,C → λ, aB → Ba, bB → Bb} 2. Try to find the grammar type for the grammars from above and prove it based on the rules. 1