Let G be a formal grammar with the following production rules: Sigma --> 1A, A --> OB, B --> OB, B--> O. Sigma is referring to the Greek symbol for capital Sigma. Assume that the conventions in the presentation of Grammar as discussed in our course are followed, G has what specific type of grammar? * Right Linear Regular Grammar O Left Linear regular Grammar Context-Free Grammar

Let G be a formal grammar with the following production rules: Sigma --> 1A, A --> OB, B --> OB, B--> O. Sigma is referring to the Greek symbol for capital Sigma. Assume that the conventions in the presentation of Grammar as discussed in our course are followed, G has what specific type of grammar? * Right Linear Regular Grammar O Left Linear regular Grammar Context-Free 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

Question 13) Consider the following context-free grammar G over the alphabet Σ = {a, b, c}, where S is thestart variable:S → aSb | ε | acSbaUsing the rules of the grammar G, give a derivation for the word acabba.
QUESTION Consider G be a Context Free Grammar for which the production Rules are given below:S -> aB|bAA -> a|aS|bAAB -> b|bS|aBBDrive the string Arababad using the above grammar by using Right Most Derivation.
For grammar, G2 compute the following: Director(E,TE’), Director(E’,+TE’), Director(E’, ε), Director(T,FT’), Director(T’,*FT’), Director(T’,ε), Director(F,(E)), Director(F,i) The grammar G2 is attached below: E ENTE, E +TELE , ++ TFT, T*FT|E ** F– (E) | >
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'
Question 3 a) Consider the grammar E → E + E | E ∗ E | (E) | id. I. Change ambiguous grammar to non-ambiguous? II. Give a context-free grammar for generating the set of palindromes over the alphabet a,b. III. Give a context-free grammar for generating all strings over a,b such that | a |= 2∗ | b
Consider the following context-free grammar defined by the tuple G and by the rules that appear in the image. a) Show that no string in L (G) contains "ba" as a substring. It is suggested to proceed by induction over the length of the chain. b) Informally describe L (G). Justify your answer using a). (Remember that the symbol | is disjunctive, and is used in this case to compactly represent four rules.)
refer to the grammar S -> aSa | aXa X ->aXa | bYb Y -> bYb | empty where S is the start symbol, non-terminals = {S, X, Y}, terminals = {a, b} This Question: Use the pumping lemma to show that the language generated by this grammar is not regular.
Let's consider a grammar for expressions is defined as follows.<assign> -> <id> = <expr><id> -> A | B | C | D<expr> -> <id> + <expr> | <id> * <expr> | ( <expr> ) | <id>1. Is this grammar unambiguous? Can you explain in detail?2. How can I design a PDA (PushDown Automata) M that recognizes the BNF (i.e. a metasyntax notation for CFG)?
Complete the proof of Theorem 6.4. Theorem 6.4: Let G = (V, T, S, P) be any context-free grammar without λ-productions. Then there exists a context-free grammar bG = (bV , b T, S, b P) that does not have any unit-productions and that is equivalent to G. 1
Use the grammar you have created in Question 1 for an infix expression and using the technique: Syntax Directed Definition write appropriate semantic rules to convert an infixexpression of that grammar to a prefix expression.Precedence of operators are given below (high to low): ()*, / +, - =Associativity of operators are given below:+, , *, / [Left Associative]= [Right Associative]Taking into account the precedence and the associativity of the operators in this question, if any modification is needed for your grammar in Question 1 to be used in this question, do it. After the necessary modification(s), a) write the semantic rules for infix to prefix conversionb) draw the annotated parse tree for the string: a=b/(c–d)*(x+y)
Let the context-sensitive grammar G with the start variable S and the given the following rules, which describe the language L = {a^n ca^n | n ∈ IN} Subtask (c) Modify the grammar G by adding further rules so that that now exactly the words de ned as follows from the start variable Language L above the alphabet Σ = {a,b,c} can be derived.
Given the grammar G with following production rules: s → a|as|bs determine whether the following strings can be generated by the grammar G and where it can be generated, write the language for the grammar G.(i) babaab (ii) aaabbbab(iii) bbaaba