Given a grammar of the form: -> | | | + > 0 1 | 2 |...19 where ! means negation (i.e., !3 means -3, 7 means -7 and so on). 1. Derive the string !!9+4-12 and evaluate it arithmetically (assume standard arithmetic mean- ings for all terminals while evaluating). 2. State whether it is ambiguous or unambiguous. If it is ambiguous give an equivalent unam- biguous grammar. If it is unambiguous, states all the precedences and associativities enforced by the grammar.

Given a grammar of the form: -> | | | + > 0 1 | 2 |...19 where ! means negation (i.e., !3 means -3, 7 means -7 and so on). 1. Derive the string !!9+4-12 and evaluate it arithmetically (assume standard arithmetic mean- ings for all terminals while evaluating). 2. State whether it is ambiguous or unambiguous. If it is ambiguous give an equivalent unam- biguous grammar. If it is unambiguous, states all the precedences and associativities enforced by the 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

C++ Consider the language that the following grammar defines: <S> = c | <W> | c<S> <W> = abb|a<W>bb Write all strings that are in this language and that contain seven or fewer characters. If the answer includes multiple strings, you must enter the answers in alphabetical order. A. In alphabetic order, what are the two strings in this language that are 3 characters in length? B. In alphabetic order, what are the two strings in this language that are 4 characters in length? C. In alphabetic order, what are the two strings in this language that are 5 characters in length?
d. L = {ww | the same string back to back, > = {a,b,c}} Prove that the given language is not context-free.
Hello, I'm struggling to understand this problem and its elements. Would you mind providing a comprehensive solution with detailed explanations and steps? It would greatly aid my comprehension if you could break it down into clear, labeled sections. Your assistance is sincerely appreciated.
Finite Automata Question: Mention atleast 6 strings of each regular expression that is listed below: let A={a,b,c,d} B={blue,green,red} C={@,#,%,&} D={0,1,2} 1) (A*C* | C*)* 2) B.A.C* | (A+B+C+D) 3) (B* | AC)(DA | B*)
Q 3. Draw a DFA that accepts the language L = {w | na(w) = n¿(w)±1 (mod 2)} over the alphabets E = {a,b}, where n,(w) denotes the number of occurrences of symbol s in string w.
Please translate the following English sentence into a sentence of FOL: use quantifiers "Lucia owns exactly one guitar" Domain: people and things M(x): x is a musician G(x):x is a guitar player R(x): x is a guitar O(x,y): x owns y L: lucia
Question 2 c) Give a regular expression for the following regular languages, assuming the alphabet is Σ := {0, 1}. I. The set of all strings, when viewed as binary representation of integers, that are divisible by 2. II. The set of all strings containing 00. III. Give a closed-form regular expression for the set of all string not containing consecutive 00.
Question 8 nag Show that the following language is not linear. L = {w: n ≥ 0, na(w) ≥ nb(w) }. Full explain this question and text typing work only thanks
Formalize the following sentence in english: 3X. elephant(X)|
Given: Language L2 = {w e {a,b}* | w contains substring aab} Construct the DFA representing the given language L2. Assume the layout of the DFA is as follows: ->A->B->C->D*. That is, the number of states are four (4) and A is the starting state and D is the accepting state. What is the next state for input pair (D,b) in the constructed DFA? A В C D
Consider the Finite Automata D in Figure 2. a. List 3 strings of different lengths that D accepts and also 3 that it rejects. b. What is the shortest string that D accepts? What is the shortest string that D rejects? c. Describe, in your own words, what is the language of D, i.e., L(D). 93 42 Figure 2. Finite automata D