Give context-free grammars that generate the following languages. In all parts the alphabetΣ is {0, 1}.a) {w € Σ* | w contains at least two Os}b) {w € * | the length of w is even}c) {w ¤ Σ* | w starts and ends with the same symbol}d) {w € Σ* | the length of w is odd and its middle symbol is a 1}e) The empty setf) The empty string

Here,Let Σ = {0,1}, which is our alphabet.a) {ω ∈ Σ* | ω contains at least two 0s}:S -> 0S0 | 0S1…

Give context-free grammars that generate the following languages. In all parts the alphabet Σ is {0, 1}. a) {w € Σ* | w contains at least two Os} b) {w ¤ Σ* | the length of w is even} c) {w € Σ* | w starts and ends with the same symbol} d) {w € Σ* | the length of w is odd and its middle symbol is a 1} e) The empty set f) The empty string

Give context-free grammars that generate the following languages. In all parts the alphabet Σ is {0, 1}. a) {w € Σ* | w contains at least two Os} b) {w ¤ Σ* | the length of w is even} c) {w € Σ* | w starts and ends with the same symbol} d) {w € Σ* | the length of w is odd and its middle symbol is a 1} e) The empty set f) The empty string

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

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
Consider the following recursive definition to define a language L over the alphabet S={0,1}: Base Step: 1∈L Recursion Step: For each w in L, 0w0 is in L. Each string in L can be derived from the base step together with a finite number of applications of the recursion step. a) List two string in L. b) List two strings not in L. c) Write set notation to describe L.
remove left recursion from the following grammar: S S a S|U U UuU|T T t|f|T n| (S)
3. Given the following BNF grammar: -> d c | cd -> a la -> b | b Use the top-down recursive descent method which we discussed in the class to implement a parser (i.e. tdrd.parser.py) in python3 for the above BNF grammar. The input data file name is given from the command line. You may assume that there is a space character between two terminals (e.g. a a adc b ) in the data file.
Given: Language L1 = {aa, b, bc}Determine: 3th Power of L1 = L1^3Hint: The Power of L is the set of all subsets of L
PROLOG LANGUAGE We flatten a list L by first removing all lists within L and replacing them with their members. Write a Prolog rule flattenit/2 which flattens a list. Note: there is a built-in called flatten - you should not use that in your answer. For example: :- flattenit([a,b,c,[d,e],f,[c, a, b]], [a,b,c,d,e,f,c,a,b]). :- flattenit([1,2,3,4,[5,6,[7,8]]], [1,2,3,4,5,6,7,8]). :- flattenit([1,2,[3,4,[5,6],7],8,[2,4,5,8]], [1,2,3,4,5,6,7,8,2,4,5,8]).
1. For each of the following regular expressions find a language (i.e., a set of strings) over A = {a,b,c} that can be represented/described by that expression. a. a*bc + bc* b. b*aaac* а. b.
13. Show that the language L = {a" : n > 0, n # 4} is regular.
1. a) Write the regular expression for the following where ∑= (a, b)i. All string starting with a and ending with bii. even length stringsiii. odd length stringsiv. strings divisible by 3 b) Design a minimal Deterministic Finite Automata (DFA) for question a) above c) Write a regular expression to describe inputs over the alphabet {a, b, c} i. that are in sorted order ii. containing at least one a and at least one b D. Answer True or False for the following questions a) Deterministic Finite Automata (DFA) can be used to depict a set of languages that cannot be depicted using an Nondeterministic Finite Automata (NFA) (True/False)b) DFA and NFA both can depict exactly same set of languages (True/False)c) DFA can have at most one final state (True/False)d) NFA can have at most one start state (True/False)e) Every regular expression can be written using context-free grammar (CFG) (True or False)
Theoretical computer science Hello i need help with this task, 2.Part: Let L1, L2 and L3 be the following languages above the alphabet Σ= {a,b}: L1 = {s1 • aa • s2 | s1, s2 ∈ Σ* }, L2 = {ambn | m, n ∈ IN and m < n}, L3 = {s ∈ Σ* | s does not contain the substring aa}. Subtask (a): Its given the following strings: u1 = ∈, u2 = ab, u3 = aab and u4 = bb. (i) For each of these character strings ui, give the suffix set assigned to itSL1 (ui) on.(ii) For each of these character strings ui, give the suffix set assigned to itSL2 (ui) on.(iii) For each of these character strings ui, give the suffix set assigned to itSL3 (ui) on. Subtask (b): Answer the following questions and give reasons for each of them detailed.(i) Which Nerode index does the language L1 have?(ii) Which Nerode index does the language L2 have?(iii) What is the Nerode index of language L3?
Theoretical computer science Hello i need help with this task, 2.Part: Let L1, L2 and L3 be the following languages above the alphabet Σ= {a,b}: L1 = {s1 • aa • s2 | s1, s2 ∈ Σ* }, L2 = {ambn | m, n ∈ IN and m < n}, L3 = {s ∈ Σ* | s does not contain the substring aa}. Subtask: Answer the following questions and give reasons for each of them detailed.(i) Which Nerode index does the language L1 have?(ii) Which Nerode index does the language L2 have?(iii) What is the Nerode index of language L3?
Let M be the language over {a, b, c, d, e, f} accepting all strings so that: 1. There are precisely two e's in the string. 2. Every a is immediately followed by an even number of f's. 3. Every c is immediately followed by an odd number of b's. 4. b's and f's don't occur except as provided in rules 2 and 3. 5. All a's occur after the first e. 6. All c's occur before the second e. 7. In between the two e's there are exactly half as many a's as c's. Construct a context-free grammar generating M. You do not need an inductive proof, but you should explain how your construction accounts for each rule. We could eliminate one rule from m to make it regular. Which one? Why?