Consider the following context-free grammars (CFG). With the help of leftmostderivation decide whether the grammars are ambiguous or not.a) E-E+E|A |FS- OE44 | OAA - SA7| 2S3 | 0S4 |8F-E|5|(5)String: 2003+00444b) B 11BS | OSOB | ES→ AC01 | OS | is |AlA→1|B|CA |€C→ x| y |AString: 011010String: 112113c) B - 1B3| iS3 | ɛS- 2BA | 1S | 2AA Al1 |12AS3 | B | ɛ

Ambiguous grammars are the grammars by which a string is generated more than one way. In other words…

Consider the following context-free grammars (CFG). With the help of leftmost derivation decide whether the grammars are ambiguous or not. a) E E+E|A |F S- OE44 | 0A A - SA7| 2S3| OS4 | ɛ F8|5|(5) String: 2003+00444 b) B 11BS | OSOB | ɛ S- AC01 | OS | 1S|Al A 1|B|CA |€ C→ x| y |A String: 011010 String: 112113 c) B1B3| 13|ɛ S- 2BA | IS| 2A A Al1 |12AS3 | B | 8

Consider the following context-free grammars (CFG). With the help of leftmost derivation decide whether the grammars are ambiguous or not. a) E E+E|A |F S- OE44 | 0A A - SA7| 2S3| OS4 | ɛ F8|5|(5) String: 2003+00444 b) B 11BS | OSOB | ɛ S- AC01 | OS | 1S|Al A 1|B|CA |€ C→ x| y |A String: 011010 String: 112113 c) B1B3| 13|ɛ S- 2BA | IS| 2A A Al1 |12AS3 | B | 8

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

Convert Context-free grammar to CNF.X→ YaXbY→aY|aX is start symbolIf you are using any new variable for conversion then name of each variable symbol should be first two alphabets of your name with roll number and then you can increment value of roll numberExample (Sh10, Sh11, Sh12)
Let G = (V, E, R, S) be a grammar with V= {S, H, Gm J}; = {h, g. j}; and the set of rules: H>h | hJG G> Gg | Sg | HgJ J→ jH | HHJ| Jj Convert this grammar to a PDA using the method we described.
Exercise 2: The following shows a simple context free grammar (CFG) : Exercise 3: Consider the following grammar : Which of the following sentences are recognized by this grammar: 5+9+5, 2+8*(4*9)*4*(7+6), 3+7-2 S T E →>> T→> F→ ab (T) T,S | S E+T T T*F F nb (E) a) What is the type of this grammar ? b) Give the four elements of this grammar {T,N,S,P} c) Draw the parse tree for: (a,b) and (b,(a,a))
Consider the following grammar: E --> E + E | E * E | id a) Show that the grammar is ambiguous:
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 .
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>.
Given the following EBNF grammar: A -> [B, C,] D B-> '(, E, F, '), E C-> ', G D->-, G E -> " " F-> "o", "D", G-> "I" Give an example sentence that is within the grammar. NB: you can ignore whitespace.
Design a Grammar to generate Palindrome for Binary Number. Consider the right linear Grammar N={N, T, P, S}, where N=set of non-terminal = {A, B, S}, T-Set of Terminal (a, b, c), and P consists of the following rules: {SabA/bbB/a, A→aA/bB/b, B-baB/aaaA}. Construct the NDFA equivalent to the given grammar.
Consider the following grammar: X -> (Y) | b Y -> Y, X | X List LR(0) items for this grammar
Consider the Context-Free Grammar: G = ({S, A, B}, {a, b}, P, S)P = {S -> aBS | aBaA | ε, A -> aa | BSB, B -> ASa | bb } Find the leftmost derivation for the string: abbabbaaaaaaa
Let G be the following context-free grammar. G: S-> aSb | SS | ab a) Give a left-most derivation of w = aaabbb b) Give a leftmost derivation of w = aaabbabb
Remove lambda rules from the following grammar. Your answer must include the NULL set.S → aS | bS | BB→ bb | C | λ C →cC | λ