Build a context-free grammar for the language {ww^R:w∈{a,b}*}. Then give a leftmost derivation of abbbba.

Question

Question

Build a context-free grammar for the language

{ww^R:w∈{a,b}*}.

Then give a leftmost derivation of abbbba.

engineering Computer-Science

Answer 1

Answer #1

Grammar:
---------
S -> aSa | bSb | ε

leftmost derivation:
---------------------
S -> aSa -> abbSbba -> abbbba

Answer 2

Similar Homework Help Questions

Give a context-free-grammar describing the syntax of the following language. Thank you =) Give a context-free-grammar...

Give a context-free-grammar describing the syntax of the following language. Thank you =) Give a context-free-grammar describing the syntax of the following language: L = { ww| we{a, b }" } is a context- free language, where w is a non-empty string from alphabet {a, b } and wt denotes the reversal of string w.
Give a context-free grammar for the following language: L1 = {ww^R c^n : w ∈ {a,...

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.
Given the following ambiguous context free grammar (3x20) 1. (a) Explain why the grammar is ambiguous...

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)-

please do B) for me a. Give the definition of a rightmost derivation of a context free grammar G b. Show that any string that can be generated by any context free grammer G can be generated by a r...

please do B) for me a. Give the definition of a rightmost derivation of a context free grammar G b. Show that any string that can be generated by any context free grammer G can be generated by a rightmost derivation in that grammer G. a. Give the definition of a rightmost derivation of a context free grammar G b. Show that any string that can be generated by any context free grammer G can be generated by a rightmost...
Give a Context Free Grammar (CFG) for the following language: L = { w | the...

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} }
consider the language L = { a^m b^n : m>2n}, give context free grammar and Nondeteministc...

consider the language L = { a^m b^n : m>2n}, give context free grammar and Nondeteministc pUSH DOWN AUTOMATON

1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the...

1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the string aabbbb using the grammar. (b) Give an English description of the language generated by the grammar 2. Let G be the grammar below: S-ASB ab | SS (a) Show that G is ambiguous. (b) Construct an unambiguous grammar equivalent to G. 3. Find a context free grammar for the language L3- fa"b"c+m :n,m21) 4. Find a context free grammar for the language L4...
Give a context-free grammar generating the complement of the language {anbn : n ≥ 0} over...

Give a context-free grammar generating the complement of the language {anbn : n ≥ 0} over Σ = {a, b}
Give a context free grammar for the language L where L = {a"bam I n>:O and...

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...

Build a Context-Free Grammar in Chomsky Normal Form that implements the following language features: (a) an...

Build a Context-Free Grammar in Chomsky Normal Form that implements the following language features: (a) an integer-based data type, (b) a value-type variable declaration of an integer data type, and (c) an assignment expression that allows for two integer-based variables to be added together. Examples: (a) define an integer data type (b) int a; (c) a = 2 + 3;