IV) Write derivations for four strings of various lengths and describe what is the language generated, L(G) by the following grammar G. V = {S, A, B}, T = {a,b} P=SA,S→ B, BbB, AaA, AA, B1, S is the start nonterminal. V) Write derivations for four strings of various lengths and describe what is the language generated, L(G) by the following grammar SaSaa|B, B→ bB|X

IV) Write derivations for four strings of various lengths and describe what is the language generated, L(G) by the following grammar G. V = {S, A, B}, T = {a,b} P=SA,S→ B, BbB, AaA, AA, B1, S is the start nonterminal. V) Write derivations for four strings of various lengths and describe what is the language generated, L(G) by the following grammar SaSaa|B, B→ bB|X

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

Question 6 Define the language based on the rules or context free grammar given below a) L1 = {ww | w ∈ {a} ∗ } b) L2 = {ww | w ∈ {a, b} ∗ } c) L3 = {w1w2 | w1 ∈ {a} ∗ and w2 ∈ {b} ∗ } d) L4 = {w | w ∈ {a, b} ∗ and w contains the same number of as and bs} e) L5 = {w | w ∈ {a, b} ∗ , w contains the same number of as and bs, and that number is no more than 128}
Let G be a grammar with the start variable S and with the following Rules governing a language above the alphabet Σ ={0,1} describes Subtask (d) (i) Sketch a procedure by which one can speak the language L (G) clearly can enumerate more skillfully (e ciently). (ii) Outline a process by which one can use the complement of the language L (G) skillfully (e ciently) can enumerate.
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'
Provide the rules for context-free grammars that generate the following languages. L5 = {aibjck | i, j, k ∈ Znonneg, j 6= i + k}
1. Draw a parse tree for the string ddadddd using buttom-up and Top-down methods with the Context-Free Grammar below:Q → dQbb | FF → aF | ε 2. What is the problem with a grammar that generates two different parse trees? Give an example. 3. Differentiate between top-down and bottom-up parsing methods using a typical grammar. 4. 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 5. Construct the NFA that will accept the string of (dc|ac)* dc (gg|bb)*dc.
6. Give a context-free grammar generating the following language (Σ = {a, b, #}): {w#x | the reverse of x is a substring of w for w, x ∈ {a, b}∗}
Describe L(G) for the grammar G = (V, VT, S, P) where V = {0, 1, A, S}, VT = {0, 1}, and P consists of: (L(G) is a possibly infinite set of words. You can describe it by listing its elements, or explaining which elements are in the set L(G)) S → 0 S → ASA A → 1
FIRST set for CFG/grammar in C/C++. input is grammar , output is shown the first set. example input grammer : E -> TR R -> +T R| # T -> F Y Y -> *F Y | # F -> (E) | i Output :First(E)= { (, i, }First(R)= { +, #, }First(T)= { (, i, }First(Y)= { *, #, }First(F)= { (, i, } Assumptions : Epsilon is represented by ‘#’. Productions are of the form A=B, where ‘A’ is a single Non-Terminal and ‘B’ can be any combination of Terminals and Non- Terminals. L.H.S. of the first production rule is the start symbol. Grammar is not left recursive. Each production of a non-terminal is entered on a different line. Only Upper Case letters are Non-Terminals and everything else is a terminal. Do not use ‘!’ or ‘$’ as they are reserved for special purposes.
Design a context-free grammar for the following language. Use S as the start variable. Explain your CFG in brief (in not more than 3 sentences). L={w∈{a,b,c}^*:w=(a^p)(b^q)(c^r),p,q, r>0, p=2r+1, q is divisible by 3}
1. Use the algorithm described in class that takes a CFG and converts it into a CNF (Chomsky Normal Form) grammar that generates the same language as the original grammar, except possibly for the string A, to answer the following question. As part of your answer, you should say which variables are nullable, and you should give the appropriate grammar after each step of the algorithm. There are four steps. Give a CFG (context-free grammar) in CNF (Chomsky Normal Form) that generates the same language, except possibly for the string A, as the following grammar: SAB AB →bAa A → aaB bb
I. Represent the Context – free grammar of the following language: L = (anbm I n>=0, m>n) II. Construct a derivation tree of the context – free grammars in Step I above to give the following sets of strings: A. aabbbb B. abb
Build a grammar that generates the regular language denoted by the regular expression a*b* Build a grammar that generates the language an bn, for n > 0