Example 11.19An Unambiguous Expression GrammarConsider again the language Expr, which we defined with the following context-free grammar G=({E, id, +, *, (, )},{id, +, *, (, )}, R, E), where:R={E→E+EE EEE→ (E)Eid}.G is ambiguous in two ways:1.2.It fails to specify associativity. So, for example, there are two parses for the string id+id+ id, correspondingto the bracketings (id+id) + id and id+(id+id).It fails to define a precedence hierarchy for the operators + and *. So, for example, there are two parses for thestring id + id * id, corresponding to the bracketings (id+id) * id and id+(id * id). 8) Consider the unambiguous expression grammar G' of Example 11.19.a)Trace the derivation of the string id+id*id*id in G'.b) Add exponentiation (**) and unary minus (-) to Gʻ, assigning the highest precedence to unary minus, followedby exponentiation, multiplication, and addition, in that order.

The given problem deals with context-free grammars (CFGs) and their ambiguity, specifically focusing…

8) Consider the unambiguous expression grammar G' of Example 11.19. a) Trace the derivation of the string id+id*id*id in G'. b) Add exponentiation (**) and unary minus (-) to G', assigning the highest precedence to unary minus, followed by exponentiation, multiplication, and addition, in that order.

8) Consider the unambiguous expression grammar G' of Example 11.19. a) Trace the derivation of the string id+ididid in G'. b) Add exponentiation (**) and unary minus (-) to G', assigning the highest precedence to unary minus, followed by exponentiation, multiplication, and addition, in that order.

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 following recursive definition to define a language L over the alphabet S={0,1}: Base Step: 1∈L Recursion Step: For each w in L, 0w0 is in L. Each string in L can be derived from the base step together with a finite number of applications of the recursion step. a) List two string in L. b) List two strings not in L. c) Write set notation to describe L.
3. ?. Complete parts a) and b). X y a) :) Convert the following NFA into a DFA: {p} {p.q} {t} {r,s} r {t} {p,r} *S Ø *t Ø Ø b) DI Describe the language accepted by the finite automata in 3.a).
10. A. top-down C. syntax directed Cancel RESET _parser cannot handle left recursive grammar fy A © B. bottom up none of the above D. Done
2. Morphology, syntax (a) In German, the ending of a regular verb in present tense is normally t for third person singular, unless the stem ends on t or d, in which case the ending is et. Examples are: stem 3rd sing. lern lernt arbeit arbeitet red redet Draw a finite-state transducer that maps a stem to this verb form. To be precise, the input is the stem of a regular verb followed by the symbol #, and the output is the third person singular present tense form of that stem, without the final #. As transition label you can use the abbreviation other, which is short for a:a, b:b, c:C, e:e, ..., that is, a mapping from any letter (other than t or d) to that same •.•/
(1) Fill the blanks to complete the following sentences that describe the relations between regular expression, regular language, and regular gramma. You can also use your own statements to describe the relations. there is an NFA machine to (i) A language L is regular (ii) A language L is regular (ii1)A language L is regular it. there is a regular expression r to it. there is a regular grammar G to it.
Problem 3. (Regular Expressions-DFA) Show that the following languages are regular by giving a regular expression and DFA that describes each one: a) L1= {all strings over Σ= {0, 1} containing at least three 1's}. b) L2= {all strings over Σ = c) L3 = {all strings over Σ = d) L4= {all strings over Σ = e) L5= {all strings over Σ = {0, 1} that contain the substring 11 and the substring 00}. {0,1} that does not contain the substring 111}. {a,b,c} with length less than 2}. {a,b,c} in which the number of c's is divisible by 32}.
c++ question Describing Syntax and Semantics
ints) Use Pumping Lemma for CFLS to show that the language L= {a"b"c?n: n 2 0} is NOT a Context Free Language.