QUESTION 2: Consider the following grammar (the start symbol is X; the alphabets are implicit in the rules): to answer the following: X- BX | € B - B1 | OB1 | 01 A. Give a right-most derivation for the terminal string: 010101. B. Give a left-most derivation for the terminal string: 010101. C. Show that the grammar is ambiguous by exhibiting two distinct derivation trees for some terminal string example 0011l.

QUESTION 2: Consider the following grammar (the start symbol is X; the alphabets are implicit in the rules): to answer the following: X- BX | € B - B1 | OB1 | 01 A. Give a right-most derivation for the terminal string: 010101. B. Give a left-most derivation for the terminal string: 010101. C. Show that the grammar is ambiguous by exhibiting two distinct derivation trees for some terminal string example 0011l.

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

Consider the ambiguous grammar S → ABS | ABA → aA | λB → bB | λ What is the shortest string in L(S) other than λ that can be used to show the grammar is ambiguous? Write the string without any spaces or quotation marks. Now show the grammar ambiguous by giving two derivations for the string (each derivation should have a particular important property). Give the two shortest derivations you can find, writing the shorter one in the first box. Your derivations should begin with S, end with your chosen string, and only make one substitution per step. Do not include any spaces, quotes, or lambdas in your answer. Use the ">" character to represent the right arrow. For example, S>aSb>ab might be a legal derivation for a string in another language.
Write a BNF grammar for simple phone numbers e.g. (9)123-4567 (21)987-1234 The number must start with a left parenthesis, followed by 1or 2 digits, followed by a right parenthesis, followed by 3 digits, followed by a hyphen, followed by 4 digits. All digits, including 0, can be used anywhere a digit is required. There must be at least 3 rules in your grammar. The goal non-terminal should be called <phone>.
boolval denotes the token for Boolean literal (e.g., true, false). A denotes the Boolean AND operator, and O denotes the Boolean OR operator. You are given the following BNF grammar: → boolval | A | 0 (a) Draw the parse tree of this expression: A true O 0 false true A true false (b)According to the token(s) and the grammar rule(s) mentioned in the beginning of Question 2, write a grammar file that can be used in SableCC.
You are given the following context-free grammar:S → EGF HE → eE | eF → f | EG → gH → hH | hh | eQUESTIONS:1. Convert the grammar into the Chomsky normal form(show all steps of the conversion).2. Use the CYK algorithm to check if the word egehh is inthe language of the grammar.
1. Use the algorithm described in our course materials (videos) that takes a CFG and converts it into a CNF 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: S АВ → abA|A → bBb|bb A B
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
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.
Consider the following grammar and denotational semantics: -> 0 | 1 | 0 | 1 densem(0) = 1 densem(1) = 0 densem(0 ) = 1 + densem() densem(1 ) = densem() %D What is the meaning of the string 01101? Correct Answer: 2
Consider the following context-free grammar. S→aBa∣B B→bbC∣cc∣ε C→cC∣bBcCb∣ε Notice that the start variable is not on the right hand side of any replacement rule. This question addresses how the grammar will be changed when applying the second step of converting it to Chomsky normal form -- namely, removing ε-rules. Which of the following rules would be added to the grammar when the ε-rules are removed? Select all that apply. Question 2 options: S→ε S→bb B→bb C→c C→bcb
1 CFGS Consider the following grammar. erpr := erpr + expr | erpr + erpr|(crpr) | number number := number digit | digit digit := 0 I 1 | 21 3I 4I5I 6I7 | 8 I 9 1. Redefine the grammar in a way that numbers are defined by regular expressions. That is, remove two grammar rules for number and digit nonterminals, and replace them with a single regular expres- sions for numbers. 2. Modify the grammar to define assignment statements with a syntax similar to C/C+, where ex- pressions are assigned to identifiers. Here are the steps: (a) Add identifier token ID to the CFG. You may define it with regular expressions (since identi- fiers are tokens). We have already seen how to define identifiers with regular expressions, in previous sessions. (b) Consider a nonterminal for assignment. Let's call this nonterminal assignment. You need to define a CFG rule that defines assignment. An assignment in C/C+ grammatically consists of an identifier (defined in previous step), folowed by equality symbol (a…
Consider the following grammars where anything starting in a lowercase or special character (parenthesis, colon) is a terminal symbol, and anything starting in an uppercase is a non-terminal symbol. Are these grammars LL(k) for some k, and if yes, what is the value of k? Explain your answer. a. A => a B a a A => b B ba B => b B => epsilon b. ClassAttr => Name (); ClassAttr => Name; Name => id Qual Qualid Qual Qual > epsilon
Process Programming Contr New Information Machine Networks Modelling Constraint Computational Learning Resor Complexity Proteins Analysis Software Algorithms Engineering Optimisation Model Foundations Constraints Applications Systems Logic Reasoning Dig Theory Data Refinement Games Search Neural Models Inference