Answered: Problem 1. Write a Grammar for the… | bartleby

Related questions

Question

Problem 1. Write a Grammar for the following Languages:
a) L = {hi, there}
b)
L= {0" 11: n ≥ 2}
c) L = {11w00: w € {a,b}"}
d)
L = {w: w E Σ and Σ = {0,1} and |w|mod 3 = 0}
e) L = {anb2n: n ≥ 0}
f) L = {waw: wEE* and Σ = {a,b}}

Expert Solution

Step by step

Solved in 5 steps

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

10) Find a regular grammar for the language: L = (a*b + b*a)*
10 letter b
Construct the context-free grammar that generates the following language: L = { 0m1" | 3m = 0}
7) Give context-free grammars that generate the following languages. i) { w € {0, 1}* | the length of w is odd and the middle symbol is 0 } ii) { a¹ b³ ck | i, j, k ≥ 0 and i + j = k } iii) { a¹ b³ ck | i, j, k ≥ 0, and i = j or i= k }
10. Please write an unambiguous context free grammar CFG of the following: {All strings consisting of unbalanced parenthesis and/or brackets}
Q No. 3: Grammar G1 = ( N = { E, T, F, I, D}, T = { +, *, (, ), 0-9}, S = {E} and P is the set of productions: E E +T | T T T * F | F E) | I DI | D F I D + 0|1|2|3|4 |5 | 6 | 7 | 8 |9 For the string w = (9*(9+9)+999), find- 1. Leftmost derivation 2. Rightmost derivation 3. Parse Tree
3. Write the parser for the following grammar: class: CLASS ID {listDecl} decl: declVar | declFunc Decl list: Decl list decl | epsilon declVar: ID ID declFunc: ID ID (arguments) arguments: declVar (, arguments | epsilon) | epsilon
Consider the language L defined by these rewrite rules S->A | AX X->ABY | AB Y->ABCY | ABC BA -> AB CA -> AC CB -> BC A->a B->b C->c Question 1: (16) (a) Derive the string “a”. (b) Derive the string “aab“ (c ) Derive the string “aaabbc” (d) Derive the string “aaaabbbcc” (e) Describe the strings that are in L.
c++ question Describing Syntax and Semantics