indicate what language is generated by the context-free grammar. The alphabet is Σ = {a, b}...

Question

Question

indicate what language is generated by the context-free grammar. The alphabet is Σ = {a, b}

• S → SaS | bS

engineering Computer-Science

Answer 1

Answer #1

language is empty language L={ }

it does not even accept epsilon

it iterates and iterates and it does not stop

because it does not contain single symbol or end symbol

Answer 2

Similar Homework Help Questions

What is the language L(G) generated by the context-free grammar G given below? S -> A...

What is the language L(G) generated by the context-free grammar G given below? S -> A | aB | bA | ε A -> aS | bAA B ->bS | aBB
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.
A grammar is a 4-tuple G, G = (Ν, Σ, Π, Σ, S) where, Ν is...

A grammar is a 4-tuple G, G = (Ν, Σ, Π, Σ, S) where, Ν is a finite set of nonterminal symbols, Σ is a finite set of terminal symbols, Π is a finite set of rules,S is the starting symbol. Let, Ν = {S, T} Σ = {a, b, c} Π = { S -> aTb S -> ab aT -> aaTb aT -> ac } S is the starting symbol. A) Prove that the given grammar G is...

Please help with the following context free grammar over alphabet (0,1): S —> A | B...

Please help with the following context free grammar over alphabet (0,1): S —> A | B A —> 1S | ^ B—> 0S | ^ a. Show that the grammar is ambiguous for a non-empty string. b. Convert the CFG to Chomsky normal Form.
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...
Give a context-free grammar generating the following language over Σ = {0, 1}: {0n1m : m,...

Give a context-free grammar generating the following language over Σ = {0, 1}: {0n1m : m, n ≥ 0; n ≠ m; n ≠ 2m}

1. Find the context free grammer for L over Σ={a,b} L ={ a3n : n =>...

1. Find the context free grammer for L over Σ={a,b} L ={ a3n : n => 0 } 2. FInd the language L that is defined by the following grammar. (Use Set Builder Notation) S bS | Sb | a 3.Create a regular expression for the following: L(r)= {w {a,b}* : w begins with an 'a' and ends with a 'b' }
Automata Theory Give a context-free grammar producing the following language over Σ = {0, 1}: {w...

Automata Theory Give a context-free grammar producing the following language over Σ = {0, 1}: {w : every odd position of w is 1 and w = wR} (HINT: All strings in the language will be of odd length).
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}

Q1: Given the below language and context free gramma:, a. Show that the grammar is ambiguous...

Q1: Given the below language and context free gramma:, a. Show that the grammar is ambiguous using the string ( abc) by using substitutions. b. Then design a push down automata that recognizes the language. C. Then show the tracing of (abc, abbccc) using the push down automata. d. Then Show which two simple languages create the greaterlanguage. Give set builder notation for each language. e. Then produce Chomsky normal form for the grammar. The following context-free language is inherently...