BASED ON DISCRETE MATHS AND COMPUTER SCIENCE The grammar GBp = ({(,)}, {S}, {S → () | S | (S)},S) generatesPROBLEM 3the language of nonempty balanced parentheses strings, that is, strings like () and (())(), butnot A, ) and (().1. Use the rules of GBp to generate the string (OO). Show clearly all the steps of the generation.2. Using the grammar GBP as a guide, write a new grammar to generate the language of twotypes of nonempty balanced parentheses strings such as []() and [[]()]. The alphabet inthis case is {(, ) , [, ]}.

S Using rule S -> SS, we get SS Using rule S -> SS on just right S above, we get SSS Using…

PROBLEM 3 The grammar GBp = ({(,)}, {S}, {S → () | SS | (S)},S) generates the language of nonempty balanced parentheses strings, that is, strings like () and (())(), but not A, ) and ((). 1. Use the rules of GBp to generate the string ())). Show clearly all the steps of the generation. 2. Using the grammar GBP as a guide, write a new grammar to generate the language of two types of nonempty balanced parentheses strings such as []() and [[]()]. The alphabet in this case is {(,), [, ]}.

PROBLEM 3 The grammar GBp = ({(,)}, {S}, {S → () | SS | (S)},S) generates the language of nonempty balanced parentheses strings, that is, strings like () and (())(), but not A, ) and ((). 1. Use the rules of GBp to generate the string ())). Show clearly all the steps of the generation. 2. Using the grammar GBP as a guide, write a new grammar to generate the language of two types of nonempty balanced parentheses strings such as []() and [[]()]. The alphabet in this case is {(,), [, ]}.

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…
Consider the following context-free grammar:G = (N, Σ, P, S)N = {S, T}Σ = {a, b, c}Productions in P are:S →aSaS →TT →bTT →TcT →ε(4.a) Write down a derivation of the string abbca from the grammar G.(4.b) Draw a parse tree corresponding to the derivation from part a).(4.c) Is the grammar G ambiguous? Explain your answer.
Consider the grammar G below in the input alphabet {x, y, z, *}, with leading non-terminal S' in rule 1. S'→S $ S → E * F S → F E → x E → z F y F F → E a) Build the LR(1) automaton of grammar G. Is this grammar LR(1)? b) List the LR(1) items in the last automaton state reached (without performing reductions on the last character) when the input is: x* z zx zxy For this question, indicate the lookahead and the top of the stack, it is also necessary to list the states in the same order as the grammar rules. Also, list the lookaheads in the order {?, $, x, y, z, *} c) Check if G is LALR. If so, answer with the number of states eliminated in relation to the previous automaton. If not, answer with -1
Consider the following Grammar G= S>0S1S | 1S0S | AWhich of the following sentences are in the language generated by this grammar? Explain with a parsing tree.a)010b)011100c)010101d)000111e)111111
Consider the context-free grammar G = (V, T, S, P), where V = {S, A}, T = {a, b}, and P consists of S → aSb | aAb, A → aA | λ. a. Show the derivation tree resulting from top-down parsing of the string aaaabb. b. Show the leftmost derivation of the string aaaabb.
Consider the Grammarbexpr ( bexpr or bterm | btermbterm ( bterm and bfactor | bfactorbfactor ( not bfactor | (bexpr) | true | falseConstruct a parse tree for the sentence not(true or false)
Describe an algorithm that given two context-free grammars G1 and G2 outputs YES if and only if every string generated by G1 is also generated by G2. (I.e., output YES exactly when the set of strings generated by G1 is a subset of the set of strings generated by G2.) Would such an algorithm be possible? why or why not
Consider the grammar:S →aAbB | CCA →a | CB | εB →bB | dC →aC | d | ε where S, A, B, and C are non-terminals, S is the start variable, and a, b, c, and d are terminals. Does the grammar have a predictive recursive descent parser? If the grammar has a predictive recursive descent parser, show that the conditions of predictive parsing apply for every non-terminal. On the other hand, if the grammar does not have a predictive recursive descent parser, then show ALL the conditions of predictive parsing that fail.
What is meant by ambiguous CFG? Prove that the grammar E→E+E/E *E /a is ambiguous.
Show that the resulting grammar is LL(1).
Consider the following grammar: X -> (Y) | bY -> Y, X | XA: . List LR(0) items for this grammarb. construct the DFA of these LR(0) itemsc. construct the SLR(1) parsing tabled. for the input string ((b),b,(b,b)),show the parsing stack and actions of the parsing SLR(1) parser.e. Is this grammar an LR(0) grammar? If not, describe the LR(0) conflict. If so, construct the LR(0) parsing table, and describe how a parse might differ from an SLR(1) parse. pay attention to the grammar given
(a) Show that the grammar S - 0 S1 I SS I € is ambiguous.