Let L, and L2 be the languages defined as follows:L1 ={ xe{0,1}* | x has an odd number of Os}.L2 ={ 0"1m0" | n, m 20}Which of the following context-free grammars generates the language L1 U L2?(Here all uppercase letters are variables)O E- 1E| OFF- 1F| OE jeA- OAO | BB - 1B|EOS-E|AE - OF | 1EF- OE | 1F|EA- OAO | 1A|EOS- S1 | S2S1 → 00S | 15 | 01A| 10A | BA- 10S | 01SB-1|8S2→ OS,0| A2A2 - 1| S2|ES-E|AE- 1E| OFF- 1F| OE jeA- OAO | BB- 1B|E

In this question, we have two languages L1 and L2 and asked the grammar for L1 U L2. L1 is a regular…

Answered: Let L, and L2 be the languages defined…

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

Find a grammar that generates the following language: {bna|n € N}
There will be the following two languages: 1. Build into one of them the Context-free grammar2. Build to the second one a Pushdown automaton (PDA)
Find the regular expressions describing the following languages defined over the alphabet E = {0,1}: i. L, = {0*1" : n2 2, m z 1, n+m 2 4} ii. L, = {x : x| mod 3 = 0} i11. L; = {pqp : p,g E {0,1}* and | p |= 3}
Let E = {0,1, 2, 3} . Write a grammar that generates the language: L = {w2" 3mwk:w E {0, 1}"and n > m > 0}
Problem 3 Design context-free grammars for the following languages: a) The set {a^i b^j c^k| i does not equal j or j does not equal k}, that is, the set of strings of a’s followed by b’s followed by c’s, such that there are either a different number of a’s and b’s different number of b’s and c’s, or both. b) The set of strings over 0 and 1 with “even” length.
Rewrite the grammar so that it is not ambiguous any more. <S> -> <A> <A> -> <A> + <A> | <id> <id> -> a | b | c
Give a context-free grammar for the following languages: R a. L₁ = {a" ww²b"; w € *, n bª; w € Σ*, n ≥ 0} ; Σ = {a,b} b. L₂ = {anbmck; n = morm ≤k; n, m, k ≥ 0}; E = {a,b,c} {a¹
Q6: Give context-free grammars that generate the following languages: w = 10 {w€ {0, 1}* ||w| is even }, |w| means the size of the string {w € {0, 1}* | the length of w is odd and the middle symbol is 0} ●
Context-Free Grammar (CFG)
Let { a b } be the alphabet set. Write a Context free grammar CFG for each of the followinglanguages:a) L = Language of all palindromeb) L = language of equal no of a’s and b’c) { \ m ≠ n, m, n ∈ N}d) R.E. = b(a+b)*e) R.E. = (ab + b)*f) R.E. = ab(ba)* + bb please solve all the parts kindly
2. A piece of declaration code in C programming language is as follows: typedef struct { int a, b; } CELL, *PCELL; CELL foo[100]; PCELL bar ( int x, CELL y ); Write the type expression for foo and bar. 3. Write an SDT for the following grammar, which can perform type checking. The type of S is the valid type of its body. S -> id := E | if E then S | while E do S | S; S
Problem 1 Construct NFAs that recognize the following languages: 1. All binary numbers that contain a 1 in the 2nd location from the right (e.g. 10, 10111, ...). 2. All binary numbers that contain 00 or 11. 3. All binary numbers that contain an even number of 0's and an odd number of 1's. Problem 2 Via subset construction, construct DFAs from all three NFAs that were constructed in problem 1. You must show the transition tables of the DFAs you construct and their state diagram.

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS