Q-1.. Let { ab} be the alphabet set. Write a Context free grammar CFG for each of the following languages: a) {a" b* \n € N} n+1 n+2 n b) {a* b" \n eN} n+2 n+1 c) {a"* b"* \n EN} d) {a" b" \ m# n, m, n e N} e) R.E. = b(a+b)* f) R.E. = (ab+ b)* g) R.E. = ab(ba)* + bb h) L= Language of all palindrome i) L= language of equal no of a's and b' Q-2. Give the descriptive definition of the language generated by the following grammar. Draw the corresponding total language tree. S- ab | aXX X- bb | a

Q: D Question 2 Give a context-free grammar for each of the following two languages, assuming E {a, b}…

A: Context free grammar of the given languages

Q: Determine the languages L(G) generated by the following grammars? S → Ab A → aAb |A L(G) = { am1 b"…

A: In given problem, we have a grammar G S-->Ab A--> aAb | λ We have to determine the language of…

Q: Let E = {a, b, c}. Write a grammar that generates the language: %3D L = {c"ww" a":n > 0, m > 0, w E…

A: To do: Write a grammar that generates a language

Q: Let E = {0,1, 2, 3}. Write a grammar that generates the language: L = {w2" 3m wR:w E {0, 1}"and n >…

A: Given: ∑ = {0,1,2,3} Language L = {w2n3mwR:w ∈ {0,1}+ ans n>m≥0}

Q: Consider the following grammar G: S> XZ X→ abXba |e |Y Y> cYd|cd z> abz| € a. What are the variables…

A: Please give positive ratings for my efforts.    As per guidelines, we are allowed to answer only the…

Q: 2. Convert Following grammar to CNF {wcw' | w e 0 {a, b}*},

A: Procedure for CNF construction: 1)convert total right hand side part into only variable assuming…

Q: Let E = {a, b}. For each of the following languages, find a grammar that generates it. (a) L1 =…

A: Note : As per our guidelines we are supposed to answer only 3 subparts , please repost other…

Q: b. Consider the language L generated by the following grammars G, {S→ AB | AA A- BB | a B→ AB | b}…

A: Dear Student, For applying CFK algorithm first we need to check whether the grammar is in Chomsky…

Q: 1. Give context-free grammars to generate the following languages: (a) L1 = {vuvkw : u, v, w E {0,…

A: A context free grammar is in the form  CFG {N,T,P,S} where N- set of Non terminal symbols T- set of…

Q: 3. Write a program in C++ to check whether a string belongs to a grammar or not for the following…

A: 1.Write a C++ program to test whether a given digit is valid or not by entering on output your ID to…

Q: *.The following grammar is E>E+T|T T>T*F[F F> id a) not Unambiguous O

A: The given grammar is Unambiguous. Def of Unambiguous A grammar can be unambiguous if the grammar…

Q: 2. Give context-free grammars that generate the following languages. a) L= {wIw contains at least…

A: Assume that the alphabet ∑ is over {0,1}. The context free grammar that generate the language, {w|…

Q: Consider the following grammar: S➞ ACB/CbB/Ba A➞ da/BC B➞ g/∈ C➞ h/∈ What is the first of B? 1. {…

A: First of B:production rule of B:B -> g/e //here e is epsilong is terminale is epsilon so, from…

Q: Consider the following grammar: E? T + E {print (“*”)} E? T { } T?int {print(“num”)} T? int * T…

A: Solution: figure 1:

Q: This is a question from my first Theory of Computing practice homework assignment included as an…

A: b.)Let G be the grammar,G = (V, Σ, R, S) with set of variables V = {S, X}, where S is the start…

Q: 3. Give a context-free grammars that generates the following languages: (a) {w | w contains at least…

A: Context free grammar that generates: (a){w | contains at least three 1s} Ans: The context free…

Q: For the grammar G = (V,T,S,P) where P: S->0S1|A and T = {0,1} Which of the following describes L(G)…

A: S-> 0S1|λ.  ( Given)  And  If S-> 0S1 that mean 01 come at least one time so that  0 n 1 n |…

Q: Find context-free grammars for the following languages (with n ≥ 0, m ≥ 0). a) L = {anbm : 2n ≤ m ≤…

A: Context-free grammar A CFG consist of a finite group of grammar rules is a quadruple (A, B, C, G)…

Q: ) Find context-free grammars for the following languages (with n ≥ 0, m ≥ 0) a) L = {anbm : 2n ≤ m…

A: Actually, given information is: L = {anbm : 2n ≤ m ≤ 3n}.

Q: Consider the following grammar: S➞ A A➞ aBA' A'➞ dA'/∈ B➞ b C➞ g What is the follow of C? 1. Ø 2.…

A: To compute First(A) for all nonterminals A, apply following rules until nothing can be added to…

Q: Find context-free grammars for the following languages: (2 × 4) (a) L = a n b n , n is even

A: A context-free grammar for L is G = ({S}, {a, b}, S, S → aaAbb|aaaaSbbbb)

Q: Consider the following grammar: S→ A A→ aBA' A'→ dA'/E B→ b C-g What is the follow of C? 1. Ø 2. { $…

A: Ans is option 1 We have to find first and follow of all right side candidates, when we do this g is…

Q: This is not a writing assingment but it keeps getting rejected as one.  Provide a CFG (context-free…

A: I have answered all the 3 parts and have uploaded image for the solution.  I have mentioned what…

Q: Grammar is as follows: P → H| PbdH H → a|(P)

A: SLR closure table Goto Kernel State Closure   {P -> .H} 0 {P -> .H; H -> .a; H ->…

Q: Consider the language L=(a*+b)*. Which of the following grammar depicts the language L? a) S → aS…

A: Explanation:  In language L, having a number of a's can be 0 but the number of b's is always more…

Q: Consider the language L=(a*+b)*. Which of the following grammar depicts the language L? a) S → aS…

A: (a*+b)* means zero or more occurrence of (a*+b). Here even empty string is in the language. But in…

Q: 1. Check the grammar below and justify whether the grammar is LL(1) or not: U+Ta U U+TaT T> a TbT T…

A: Here in this question we ha e given a grammer and we have asked to find weather the grammer is LL(1)…

Q: Consider the following grammar: → | → a a | → b b | bb → ab | ab → ba | ba Rewrite this…

A: The given grammar is:…

Q: Let E = {0, 1, 2, 3}. Write a grammar that generates the language: L = {w2" 3m wR: wE {0, 1}" and n…

A: The Answer is

Q: Consider the following grammar S → - F | F F →  D | D . D D →  N | N D N → 0 | 1 | 2 | 3 | 4 | 5 | 6…

A: One has to remove Left recursion and Left Factoring from the given grammar. Then only Recursive…

Q: (b) Rewrite the grammar below to make it unambiguous. -> | ɛ -> 01 | 1 | 0 1

A: The grammar is said to be an ambiguous grammar when it is both left recursive and right recursive.…

Q: Consider the following grammar: S- A А— аВА' A'→ dA'/E B→ b C→g What is the follow of C?

A: According to question To compute First(A) for all nonterminals A,  we apply the following rules  and…

Q: 1. Consider the following Grammar S- E E – TE' E' → +E |-E | ɛ | F → id | num T - FT' T' → *T | /T |…

A: Ambiguous Grammar : A grammar is ambiguous if we have more than one way of processing any…

Q: Give context-free grammars that generate the following languages. In all parts, the alphabet Σ is…

A: Answer :  1. context free grammar for language with at least two 0's   S →X0X0X X→0X|1X|E or…

Q: Write a context free grammar generating the language{0^(3a) 1 ^ (2b) 0^ (2b) 1^ (a) :a >0, b…

A: Answer :  {0^3a 1^2b 0^2b 1^a :a >0, b >0} Context Free GrammarS -> 000S1 | 000A1A ->…

Q: 1) Find context-free grammars for the following languages: (a) L = anbn, n is even. (b) L = anbn, n…

A: Actually, given information is: (a) L = anbn, n is even. (b) L = anbn, n is odd. (c)L = anbn, n is a…

Q: Find context-free grammars for the following languages (with n 2 0, m 2 0) L={a®bm:n=m- 1).

A: Context free grammar for given L is as follows :

Q: Find context-free grammars for the following languages (with n 2 0, m 2 0) L= {a^bm:n=m- 1}.

A:

Q: Construct a PDA for the following grammar. E → E +T | T T → T × F | F F → (E) | a Note: First, you…

A: A pushdown automata for the given grammar

Q: Find context-free grammars for the following languages: (a) L = anbn, n is even.  (b) L = anbn, n…

A: This is a structured grammar that is used in a given formal language to create all various concepts…

Q: 5. Find a grammar for each language. a. The even palindromes over {a, b, c}. b. The odd palindromes…

A: Context free grammar of the given languages

Q: 1. Design a context free grammar for the following language. L = { 0°1" |m,n >= 0, n !=m }

A:

Q: 1. Design a context free grammar for the following language. L = { 0°1" |m,n >=0, n !=m }

A: Here we write string accepted this language:…

Q: Design a context-free grammar for the following language. Use S as the start variable. Explain your…

A: Context Free Grammar: A grammar contain a context free grammar then it must be a context free…

Q: Consider a context free grammar G: s>aAA| B[ C|a A→AB[E| ɛ|AXc

A: Given:

Q: 3. What is parsing? Consider the following grammar- S- TL T int float L+L, id id Parse the following…

A: Here is the answer:-

Q: 2. Draw the DFA for the following languages a. L = {w\w contains substring "aba" and has b in the…

A: One assumption has made that language contains only {a,b} or {0,1}.

Q: 2. Draw the DFA for the following languages a. L = {w\w contains substring "aba" and has b in the…

A: Note As per BNED rules we are allowed to answer 1 question at a time . SOLUTION  One assumption has…

Q: Show that the following grammar is ambiguous. S → AB | C A → 11 |0 В — 22 10 С — 0С10

A: We are going to see if the given grammar is ambiguous. TIP- If more than 1 parse tree exist for same…

Q: Write a BNF grammar that describes the structure of U.S. telephone numbers, which can be either…

A: Backus Naur Form (BNF): Syntax of the programming language is represented by using the notation…