Convert the given CFG to CNF: a) E-> E+T | T, T-> T*F | F, F -> 0 | 1 | (E) o where the set of terminals is {+, *, (, ), 0, 1} b) s-> i(B)SK | p, K -> os | ɛ, B -> t | f o where the set of terminals is {(, ), i, o, t, f, p} c) S-> -s | S=S | (S) | p | q o where the set of terminals is {-, =, (, ), p, q}

Convert the given CFG to CNF: a) E-> E+T | T, T-> TF | F, F -> 0 | 1 | (E) o where the set of terminals is {+, , (, ), 0, 1} b) s-> i(B)SK | p, K -> os | ɛ, B -> t | f o where the set of terminals is {(, ), i, o, t, f, p} c) S-> -s | S=S | (S) | p | q o where the set of terminals is {-, =, (, ), p, q}

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

Suppose (X[mX]+Y [mY ]) > 0. What can you infer about each of the four subproblems (namely, (X1, Y1), (X1, Y2), (X2, Y1), and (X2, Y2))? Clearly identify the ones that do not have to solved anymore, and those that still have to be solved. Briefly justify.
Present a coding technnique that accepts 2 numbers x,y that will result into a transformation L: R^2 -> R^2 Example: L(x,y) = (x-y,x+y) .
Q#2.(a): Using the FAs corresponding to r1=(a+b)*(aaa+bbb)(a+b)* and r2=aa(a+b)*, build an NFA corresponding to r1+r2 (b): Using the FAs corresponding to r1=(a+b)*(aaa+bbb)(a+b)* and r2=aa(a+b)*, build an NFA equivalent to FA1FA2 NOTE:SUBJECT:THEORY OF AUTOMATA
Mapping is a process in which data is transformed between main memory and cache memory. Consider a computer with main memory capable of storing 1024 K words, each word in memory is 64 bits. The computer has cache memory capable of storing 2048 words, each word is of size 64 bits. Discuss with suitable diagram how associative mapping method can be used to transform data between main memory and cache memory?
Name 2 ways domain decomposition (with overlap n) is superior to a single domain, name 2 ways it may be inferior.
Suppose L1, L2 are two regular languages over the alphabet Σ = {a, b}. Consider the following two new languages: shuffle1(L1, L2) = {a1b1 . . . anbn : a1 . . . an ∈ L1, b1 . . . bn ∈ L2, ai, bi ∈ Σ, ai = bi, i ∈ [1 . . . n]} shuffle2(L1, L2) = {a1b1 . . . anbn : a1 . . . an ∈ L1, b1 . . . bn ∈ L2, ai, bi ∈ Σ, an−(i−1) = bi, i ∈ [1 . . . n]} Notice how shuffle1, shuffle2 are similar, but not quite the same. One of them is necessarily regular and the other is not necessarily regular.Which is which? Prove your answer. If part of your proof relies on a construction, you do not need to prove its correctness.
Prolog Consider the (directed) network in the attached document. We could represent this network with the following Prolog statements: link(a,b). link(a,c). link(b,c). link(b,d). link(c,d). link(d,e). link(d,f). link(e,f). link(f,g). Now, given this network, we say that there is a "connection" from a node "X" to a node "Y" if we can get from "X" to "Y" via a series of links, for example, in this network, there is a connection from "a" to "d", and a connection from "c" to "f", etc. Formulate the appropriate Prolog rule "connection(X,Y)" which is true if (and only if) there is a "connection" from "X" to "Y" as described above --- note that this rule will be recursive. Test this rule out on the above network, to see if it is working correctly. Once it is working correctly, you will note that, e.g., the query "connection(a,e)." will give "true" multiple times. This means something, actually:
a) Construct a simplest possible PDA using state transition diagram that accepts the language L over alphabets {0, 1, 2} that precisely contains those strings where, the first, middle and the last letter or symbol in the string are the same. b) Demonstrate by computation that 01020  L(M) and 10201 L(M) to validate the PDA that you have constructed.
Design a memory map to work with 8085 Microprocessor to have 8K byte ROM and 2K byte RAM. ROM should start from memory location 0000H and RAM immediately follows it. Use exhaustive decoding scheme?
Given: Language L3 = {w ϵ {a,b}* | w starts in ab and ends in bb} Construct the DFA representing the given language L3. Assume the layout of the DFA is as follows: ->A->B->C->D->E*. That is, the number of states are five (5) and A is the starting state and E is the accepting state. How many self-loop edge/s in the constructed DFA representing the given language L3? Don't give wrong answer. Upvote for only correct one else down
The language must be in python. Neural Network Units weights of [-1.2, -1.1, 3.3, -2.1] two training examples:Example 1: [0.9, 10.0, 3.1, 1]Example 2: [0.9, 2.1, 3.7, 1] Note that you don't have to explicitly include a threshold or bias since the examples include a last element of 1 which means that the last weight effectively operates as a threshold. Create a single ReLU unit and provide the outputs for those examples. Calculate the derivative of the sigmoid with respect to net input for both examples Calculate the derivative of the ReLU with respect to net input for both examples
The language for coding must be in python Neural Network Units Implement a single sigmoid neural network unit with weights of [-1.2, -1.1, 3.3, -2.1] Calculate the outputs for two training examples:Example 1: [0.9, 10.0, 3.1, 1]Example 2: [0.9, 2.1, 3.7, 1] Note that you don't have to explicitly include a threshold or bias since the examples include a last element of 1 which means that the last weight effectively operates as a threshold. Assuming that a sigmoid unit response >0.5 denotes a positive class and <0.5 is negative class, is example 1 positive or negative? is example 2 positive or negative? Create a single ReLU unit and provide the outputs for those examples. Calculate the derivative of the sigmoid with respect to net input for both examples Calculate the derivative of the ReLU with respect to net input for both examples