Let G = (AN , AT , S, P) be a context-free grammar in Chomsky
normal form. Prove that if there exists a word w ∈ L(G) generated
by a derivation that uses more than |P| + |AT | steps, then L(G) is
infinite.
Consider the context-free grammar G = ( {S}, {a, b}, S, P) where
P = { S -> aaSb | aab }.
Construct a NPDA M that such that L(M) = L(G).
I would like the transition graph for this NPDA please.
Consider the following context-free grammar
G:
E ® T +
E ® * T i
E ® f i
E ® * f +
T ® +
Questions:
(5 points) Compute the Canonical LR(1) Closure
set for state I0 for grammar G.
(10 points) Compute (draw) the DFA that
recognizes the Canonical LR(1) sets of items for grammar G.
(5 points) Construct the corresponding
Canonical LR(1) parsing table.
(10 points) Compute (draw) the DFA for
LALR(1).
(5 points) Construct LALR(1)...
Prove the following Closure Properties with respect to Context
Free Languages.
1. Show that Context Free Languages are Closed under union(∪),
concatenation(·), kleene star(*).
(Hint: If L1 and L2 are Context Free languages then write
Context Free grammar equivalent to L1 ∪ L2, L1 · L2, L∗ 1 )
2. Show that if L1 and L2 are Context Free Languages, then L1 ∩
L2 is not necessarily Context Free.
(Hint: Use Proof by Counter Example)
Write down a Context Free Grammar with 8 productions including 4
variables and 3 terminals. i. Check whether the Context Free
Grammar is ambiguous or not. Justify your answer with necessary
example. ii. Finally, construct the reduced grammar corresponding
to your generated grammar.
Using Kurosch's subgroup theorem for free proucts,prove that
every finite subgroup of the free product of finite groups is
isomorphic to a subgroup of some free factor.