Give a context-free-grammar describing the syntax of the following language.
Thank you =)
context-free grammar G = < V, , S , P > generates L :
V = { S } , = { a , b } and P = { S -> aSa , S -> bSb
, S -> aa , S -> bb }.
Give a context-free-grammar describing the syntax of the following language. Thank you =) Give a context-free-grammar...
Give a context-free grammar for the following language: L1 = {ww^R c^n : w ∈ {a, b}*, n >= 0}, i.e each string consists of a string w containing a’s and b’s, followed by the reverse of w, followed by 0 or more c’s.
Give a Context Free Grammar (CFG) for the following language: L = { w | the number of a’s and the number of b’s in w are equal, ∑= {a, b} }
5. (5 points) Give context-free grammar that generate the following languages (1) (w is a binary string, and w starts and ends with the same symbol (2) the empty language (empty set)
Give a context-free grammar for the following language over = {0, 1}: L={w : w is not a palindrome}
Give a context free grammar for the language L where L = {a"bam I n>:O and there exists k>-o such that m=2"k+n) 3. Give a nondeterministic pushdown automata that recognizes the set of strings in L from question 3 above. Acceptance should be by accept state. 4. 5 Give a context-free grammar for the set (abc il j or j -k) ie, the set of strings of a's followed by b's followed by c's, such that there are either a...
4. (Non-CFLs) Prove that the following languages are not context-free. (b) The following language over the alphabet {a, b, c}: B = {aix | i ≥ 0, x ∈ {b, c}* , and if i = 1 then x = ww for some string w}. (Careful: B satisfies the pumping lemma for CFLs! Make sure you understand why, but you don’t need to write it down.)
Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and i 2j +k} b) {w E 0,1' | the length of w is even, started by 1 and ended 01} Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and i 2j +k} b) {w E 0,1' | the length of w is even, started by 1 and ended 01}
Given the following ambiguous context free grammar (3x20) 1. (a) Explain why the grammar is ambiguous (b) Find an equivalent unambiguous context-free grammar. (c) Give the unique leftmost derivation and derivation tree for the string s generated from the unambiguous grammar above. 2. Construct non-deterministic pushdown automata to accept the following language (20) 3. Convert the following CFG into an cquivalent CFG in Chomsky Normal Form (CNF) (20)-
Find the context free Grammar for the following language L = {w ∈ {a, b, c}* : na (w) + nb (w) ≠ nc (w)}.
1. Give a context-free grammar for the set BAL of balanced strings of delimiters of three types (), and . For example, (OOis in BAL but [) is not. Give a nondeterministic pushdown automata that recognizes the set of strings in BAL as defined in problem 1 above. Acceptance should be by accept state. 2. Give a context free grammar for the language L where L-(a"b'am I n>-o and there exists k>-o such that m-2*ktn) 3. Give a nondeterministic pushdown...