Q1 Consider the following regular grammar with start symbol S. {S→ aS, S→ aB, S→ aA, A→ 6S, A→ bB, A→ A, B → aS, B → bB, B → A} Q1.1 RG to RE conversion Covert the regular grammar into a regular expression. • Recommendation: eliminate variables in the order B then A then S. Q1.2 RG to DRG conversion Convert the regular grammar into a deterministic regular grammar.

Q1 Consider the following regular grammar with start symbol S. {S→ aS, S→ aB, S→ aA, A→ 6S, A→ bB, A→ A, B → aS, B → bB, B → A} Q1.1 RG to RE conversion Covert the regular grammar into a regular expression. • Recommendation: eliminate variables in the order B then A then S. Q1.2 RG to DRG conversion Convert the regular grammar into a deterministic regular grammar.

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

Grammar and its application to FractalsLet G=(N,T,P,∑) where ∑ is the start symbol, N = {D}, T = {d, r, l}, andP = {∑→D, D→DrDllDrD, D → d} 1. Give the most specific type of grammar G.2. Show the leftmost derivation sequence of the string drdlldrd, (i.e. When deriving a new sentential form, always replace one Nonterminal at a time and always replace the leftmost Nonterminal)3. Suppose d is an abstraction of a command to draw a straight line of fixed length in the current direction, r is an abstraction of a command to turn right by 60 degrees, and l is an abstraction of a command to turn left by 60 degrees. Assuming that you are to start from a point and that the starting direction is to proceed horizontally to the right, show the figure represented by the generated string drdlldrd.4. The string drdlldrdrdrdlldrdlldrdlldrdrdrdlldrd can also be generated. Assuming that you are to start from a point and that the starting direction is to proceed horizontally to the right, show the figure…
(20 Points) Consider the following grammars where S is the start symbol and a, b, and c are terminal symbols and A, B, and C are non-terminal symbols.S ---> aA | bB | cCA --> aA | aB | aB --> bB | bC | bC --> cC | cExplain in your own words what the grammar generates. Which of the following sentences are in the language generated by the grammar? Show derivations. If a sentence cannot be generated by the grammar, explain why abcabcab aaaaaabb cccccaaaa bbbbbbbc aaaaaaccc
Consider the grammar G = ({S, A}, S, {a, b}, P) with the following set of production rules P: S → aS|baA|abaAA → aAbb|aAb|ε 1. Determine what the language generated by G is. You may only use set builder notation and/or language operators in your answer. A proof is not required. 2. Show that the grammar G is ambiguous by: (a) Providing two distinct leftmost derivations for the same string w ∈ L(G).(b) Providing two distinct parse trees for the same string w ∈ L(G).
answer the following and explain Establish that L is context-free by building a CF grammar for L = {0n1m: n does not equal 6m and n,m ≥0}
Show a derivation tree for w = aaabbaaa using the grammar in Example 5.1. EXAMPLE 5.1 The grammar G = ({S}, {a, b}, S, P), with productions S→aSa,S→bSb,S→λ,S→aSa,S→bSb,S→λ, is context-free. A typical derivation in this grammar is S ⇒ aSa ⇒ aaSaa ⇒ aabSbaa ⇒ aabbaa. This, and similar derivations, make it clear that L (G) = {wwR : w ∈ {a, b}*}.
Question No. 1: Consider the Grammar: PLEASE REFER TO IMAGE FOR CORRECT FORMATTING OF THE QUESTION A à B a | c B b | d C b | d C a B à q | e | A a C C à f A C B | q a) Eliminate the left recursion from the given grammar (if exists). b) Remove the left factoring from the given grammar (if exists). c) Make unambiguous if ambiguity found in given grammar d) Describe the language generated by this grammar, also give five strings that can accept by this grammar. e) Calculate FIRST & FOLLOW sets as needed. f) Construct an LL (1) parse table for the grammar. g) Use the parse table to recognize the sentence ‘c d f c q a q f a’. Show the stack implementation.
for the grammars below, determine if they're ambiguous; and if a grammar is ambiguous, find a string that demonstrates the ambiguity and also draw two different parse trees for the string: a) S → aSa | bSb | cSc | a | b | c | ε b) S → ε | ab | ba | aSb | bSa c) S → aSb | C C → ε | c | Cc
A grammar is left recursive if the grammar has any non-terminal whose derivation contains itself as the left-most symbol as in the production. Consider the grammar G1: E → E + T|T T → T ∗ F|F F → (E)|id Show that G1 is left recursive and transform G1 into a non – left recursive grammar called G2. Construct a recursive – descent parser for G2.
L = {(a^n)(b^m)(c^k) ; n = m or m ≠ k } Find context free grammars (with n, m, k greater than or equal to 0)
1. a) Construct the NFA that will accept the string of (dc|ac)* dc (aa|bb)*dc b) Construct the NFA that will accept the string of the regular expression dc(a|b|c)* (aa|dc)* c) Construct the grammar and generate the Leftmost Derivation (LMD) and the Rightmost Derivation (RMD) for the expression 9-5+2 d.Construct a Non-deterministic Finite Automata (NFA) that can recognize the set of strings formed by acb (ab/c)*
Question 2-Context-free Grammars Consider the alphabet = {A, V., (,), x, y, z) and the following grammar G = (V,E, R, F), defined by the rules: F (FAF) | (FVF) | (F) | P (a) Identify the set of variables and the set of terminal symbols of G. (b) Identify three words (of lengths between 10 and 20) that can be generated by the above grammar and show their derivations. (c) Consider a modified grammar G', where we remove the brackets '(' and ')' from the alphabet and the derivation rules. That is we set Σ'= {A, V., x, y, z) and we remove all occurrences of brackets in the derivation rules. Show that there are words that are derived ambiguously in G'
Please create a CKY table for each of the remaining sentences. Given grammar is: S -> NP VP NP -> 'I' | 'Texas' | 'South Padre' | 'hotel' | 'beach' | 'view' | 'sunrise' | 'vacation' | 'boat' | 'water' | 'trip' | 'waves' | 'speed' VP -> 'want' 'to' V | 'like' NP | 'Go' 'to' NP | 'Get' 'a' NP | 'On' 'the' NP | 'Love' 'the' NP | 'Book' 'a' NP | 'Need' 'this' NP | 'Prefer' 'the' NP | 'enjoy' NP V -> 'travel' | 'swim' | 'be' Waves are high Prefer the boat I enjoy speed