Create a context free grammar to generate the following language, L. L = {aibj | i,...

Question

Question

Create a context free grammar to generate the following language, L.

L = {aⁱb^j | i, j ≥ 0 and j ≤ i + 2}

engineering Computer-Science

Answer 1

Answer #1

GRAMMAR

S -> aSb | aS | b | bb | epsilon

EXPLANATION

S -> aSb | epsilon is for i = j
rest are for j <= i+2

Please up vote.

Add a comment

Answer 2

Similar Homework Help Questions

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...
Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and...

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}
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 over = {0, 1}: L={w : w is...

Give a context-free grammar for the following language over = {0, 1}: L={w : w is not a palindrome}
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} }
For the language anbn+mcm, where m, n 0.. a) Create a context-free grammar that generates this...

For the language anbn+mcm, where m, n 0.. a) Create a context-free grammar that generates this language b) Create a pushdown automata that accepts this language.

Find the context free Grammar for the following language L = {w ∈ {a, b, c}*...

Find the context free Grammar for the following language L = {w ∈ {a, b, c}* : na (w) + nb (w) ≠ nc (w)}.
use JFLAP to create a grammar to generate the following language Using JFLAP Use JFLAP to...

use JFLAP to create a grammar to generate the following language Using JFLAP Use JFLAP to create a grammar to generate the following language L={ Real numbers, WITHOUT non-significant zeros at the left and/or right} Take into account that the decimal point can appear 0 or 1 time. Use the following list of numbers to evaluate your grammar (using the option "Input Multiple Brute Force Parse"):
construct a context free grammar for the language l {a^nc^mb^n: n,m Greaterthanorequalto 0}

construct a context free grammar for the language l {a^nc^mb^n: n,m Greaterthanorequalto 0}

Construct a context-free grammar for the language L={ab'ab'an> 1}.

Construct a context-free grammar for the language L={ab'ab'an> 1}.