b. Describe the language accepted by the following grammar: S→ Sa B B → B E

Question

Question

Answer 1

Answer #1

Given grammer:

S → aSa | B

B → bB | E

Here E is ϵ

Answer:

Given grammer accepts all strings which contains even number of a's and any number of b's in middle position of a's string

For example:

aaaa

aabaa

aabbaa

aabbbaa

means number of a's is divisible by 2 and all b's are in center of a's.

Answer 2

Similar Homework Help Questions

1. For the following grammar: a) Give an example of a string accepted by the grammar. b) Give an ...

Theory of Computation need ASAP 2-3 hours 1. For the following grammar: a) Give an example of a string accepted by the grammar. b) Give an example of a string not accepted by the grammar. c) Describe the language produced by the grammar. 2. Using the following grammar find a derivation for the string: 0001112 A0A1le C 0C2 | D Create a grammar for the language described by the following RE: Create a grammar for the following language: For the...
Consider the following grammar: <S> → <A> a b <A> → <A> b | b...

Consider the following grammar: <S> → <A> a b <A> → <A> b | b → a | a Is the following sentence in the language generated by this grammar? baab Consider the following grammar: <S> → a <S> c | <A> | b <A> → c <A> | c → d | <A> Is the following sentence in the language generated by this grammar? acccbcc SHOW WORK
Consider the following grammar for a language, where a and b are called terminals while <S>,...

Consider the following grammar for a language, where a and b are called terminals while <S>, <A> and are called non-terminals, where <S> is the starting entity, i.e., from which we generate strings. The goal is to generate a sequence of as

Consider the following grammar: <S> → <A> a b <A> → <A> b | b...

Consider the following grammar: <S> → <A> a b <A> → <A> b | b → a | a Which of the following sentences are in the language generated by this grammar? baab bbbab bbaaaaaS bbaab Please explain why
1. Who are language descriptions intended for? Consider the following grammar: ab b | b a...

1. Who are language descriptions intended for? Consider the following grammar: ab b | b a | a Which of the following sentences are in the language generated by this grammar? (DONE) a) baab ==> YES b) bbbab ==> NO c) bbaaaaaS ==> NO d) bbaab ==> YES 2. Write a BNF grammar for the language consisting of binary strings (any combination of 0s and 1s) of at least 2 digits.
Given that Σ={a,b}and using the appropriate notation, describe the language that will be accepted by the...

Given that Σ={a,b}and using the appropriate notation, describe the language that will be accepted by the FA 82 a a a b 04 q. b b 3 b

Consider the following grammar G: S'S SA xb AaAb B 3. do ed bisbon s LR...

Consider the following grammar G: S'S SA xb AaAb B 3. do ed bisbon s LR Bx where S, A, and B are nonterminals, and a, b and x are terminals (a) [10] Is G SLR(1)? If yes, give the parsing table. Otherwise, explain why (b) [15] Is G LR(1)? If yes, give the parsing table. Otherwise, explain why. (c) [15] Is G LALR(1)? If yes, give the parsing table. Otherwise, explain why. umi Consider the following grammar G: S'S...
Construct a regular grammar G (a" b) c (aa bb)? VT, S, P) that generates the language generated by

Construct a regular grammar G (a" b) c (aa bb)? VT, S, P) that generates the language generated by Construct a regular grammar G (a" b) c (aa bb)? VT, S, P) that generates the language generated by
For the following grammar (7 points) 1. B - Ba|A S - ABb A - Aba...

For the following grammar (7 points) 1. B - Ba|A S - ABb A - Aba |A to find a grammar without A productions that generates the same language, we first identify non-terminals that drive A. These non-terminals are: A and B. Then from S - ABb, we construct S from A - Aba, we construct A - from B - Ba, we construct B - So, the grammar without A that generates the same language is: