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

Question

Question

engineering Computer-Science

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...
Describe in English the language defined by the following grammar: <S> -> <A> <C> <A>...

Describe in English the language defined by the following grammar: <S> -> <A> <C> <A> -> a <A> | a -> b | b <C> -> c <C> | c
Consider the following regular grammar with start symbol S and terminals {x, y}. S → xS...

Consider the following regular grammar with start symbol S and terminals {x, y}. S → xS S → yX S → yY X → xX X → yS Y → xY Y → λ List four strings, each of length less than 4, accepted by this grammar. (Include ε if it is accepted.) List four strings, each of length less than 4, not accepted by this grammar. (Include ε if it is not accepted.) In English, describe the language represented...

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

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